Log in

Relevant bibliographies by topics / Branch and bound

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Branch and bound'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Branch and bound.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Branch and bound"

1

Paulavičius, Remigijus, and Julius Žilinskas. "INFLUENCE OF LIPSCHITZ BOUNDS ON THE SPEED OF GLOBAL OPTIMIZATION." Technological and Economic Development of Economy 18, no. 1 (2012): 54–66. http://dx.doi.org/10.3846/20294913.2012.661170.

Full text

Abstract:

Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed sphere. The efficiency of a branch and bound algorithm with proposed bound and combinations of bounds is evaluated experimentally while solving a number of multidimensional test problems for global optimization. The influence of different bounds on the performance of a branch and bound algorithm has been

APA, Harvard, Vancouver, ISO, and other styles

2

Jyoti, Arora, and Sharma Surbhi. "Solving Task Assignment Problem Using Branch and Bound Method." Journal of Applied Mathematics and Statistical Analysis 4, no. 1 (2023): 1–7. https://doi.org/10.5281/zenodo.7813430.

Full text

Abstract:

<em>The main aim of this paper is to present an algorithm of Branch and Bound method for solving task assignment problem. The branch and bound approach is based on divide and conquer method in which large problem is divided into smaller subsets of solutions. Our algorithm calculates lower bounds on solutions to the Task Assignment problem, which is further divided into subsets. Experimental results show that this Branch and Bound method to solve Task Assignment problem shows better results than standard Hungarian Method. A Numerical example is taken to illustrate the solution procedure</em>

APA, Harvard, Vancouver, ISO, and other styles

3

Eichfelder, Gabriele, Peter Kirst, Laura Meng, and Oliver Stein. "A general branch-and-bound framework for continuous global multiobjective optimization." Journal of Global Optimization 80, no. 1 (2021): 195–227. http://dx.doi.org/10.1007/s10898-020-00984-y.

Full text

Abstract:

AbstractCurrent generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not seem to follow their train of thought all the way. The present paper complements the various suggestions for generalizations of partial lower bounds and of overall upper bounds by general constructions for overall lower bounds from partial lower bounds, and by the corresponding termination criteria and node selection steps. In particular, our branch-and-bound concept employs a new enclosure of the set of nondominated points by a union of boxes. On this occasion we also

APA, Harvard, Vancouver, ISO, and other styles

4

Hartwig, A. "Recursive branch and bound." Optimization 16, no. 2 (1985): 219–28. http://dx.doi.org/10.1080/02331938508843011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Luzhi, Shuli Hu, Mingyang Li, and Junping Zhou. "An Exact Algorithm for Minimum Vertex Cover Problem." Mathematics 7, no. 7 (2019): 603. http://dx.doi.org/10.3390/math7070603.

Full text

Abstract:

In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower bounds to help prune the search space. One is based on the degree of vertices, and the other is based on MaxSAT reasoning. The experiment confirms that our algorithm is faster than previous exact algorithms and can find better results than heuristic algorithms.

APA, Harvard, Vancouver, ISO, and other styles

6

Jiao, Hong-Wei, Feng-Hui Wang, and Yong-Qiang Chen. "An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming." Journal of Applied Mathematics 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/160262.

Full text

Abstract:

An effective branch and bound algorithm is proposed for globally solving minimax linear fractional programming problem (MLFP). In this algorithm, the lower bounds are computed during the branch and bound search by solving a sequence of linear relaxation programming problems (LRP) of the problem (MLFP), which can be derived by using a new linear relaxation bounding technique, and which can be effectively solved by the simplex method. The proposed branch and bound algorithm is convergent to the global optimal solution of the problem (MLFP) through the successive refinement of the feasible region

APA, Harvard, Vancouver, ISO, and other styles

7

Moursli, Omar. "Branch and Bound Lower Bounds for the Hybrid Flowshop." IFAC Proceedings Volumes 30, no. 14 (1997): 31–36. http://dx.doi.org/10.1016/s1474-6670(17)42693-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Xue-Gang, and Bing-Yuan Cao. "A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming." Journal of Applied Mathematics 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/984168.

Full text

Abstract:

A simplicial branch and bound duality-bounds algorithm is presented to globally solving the linear multiplicative programming (LMP). We firstly convert the problem (LMP) into an equivalent programming one by introducingpauxiliary variables. During the branch and bound search, the required lower bounds are computed by solving ordinary linear programming problems derived by using a Lagrangian duality theory. The proposed algorithm proves that it is convergent to a global minimum through the solutions to a series of linear programming problems. Some examples are given to illustrate the feasibilit

APA, Harvard, Vancouver, ISO, and other styles

9

Sarkar, U. K., P. P. Chakrabarti, S. Ghose, and S. C. De Sarkar. "Multiple stack branch and bound." Information Processing Letters 37, no. 1 (1991): 43–48. http://dx.doi.org/10.1016/0020-0190(91)90248-g.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Przybylski, Anthony, and Xavier Gandibleux. "Multi-objective branch and bound." European Journal of Operational Research 260, no. 3 (2017): 856–72. http://dx.doi.org/10.1016/j.ejor.2017.01.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Branch and bound"

1

Turpin, Heather Jane. "The branch-and-bound paradigm." Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277168.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stix, Volker. "Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1212/1/document.pdf.

Full text

Abstract:

In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one. It is applied to the stochastic problem of optimal scenario tree reduction. The aspects of global optimization are emphasized here. All necessary components for that problem are developed and some experimental results underline the benefits of the new approach. (author's abstract)<br>Series: Working Papers on Information Systems, Information Business and Operations

APA, Harvard, Vancouver, ISO, and other styles

3

Rahman, Mostafizur. "Branch and Bound Algorithm for Multiprocessor Scheduling." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3790.

Full text

Abstract:

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two diff

APA, Harvard, Vancouver, ISO, and other styles

4

Turkensteen, Marcel. "Advanced analysis of branch and bound algorithms." [S.l. : [Groningen : s.n.] ; University Library Groningen] [Host], 2006. http://irs.ub.rug.nl/ppn/299139158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guilbeau, Jared T. "A Vector Parallel Branch and Bound Algorithm." Thesis, University of Louisiana at Lafayette, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10242153.

Full text

Abstract:

<p> Global optimization problems sometimes attain their extrema on infinite subsets of the search space, forcing mathematically rigorous programs to require large amounts of data to describe these sets. This makes these programs natural candidates for both vectorization methods and parallel computing. Here, we give a brief overview of parallel computing and vectorization methods, exploit their availability by constructing a fully distributed implementation of a mathematically rigorous Vector Parallel Branch and Bound Algorithm using MATLAB’s SPMD architecture and interval arithmetic, and

APA, Harvard, Vancouver, ISO, and other styles

6

Farias, Denilson Atilio Godry. "Paralelização da Técnica Branch and Bound com PVM." reponame:Repositório Institucional da UFPR, 2011. http://hdl.handle.net/1884/25089.

Full text

Abstract:

Resumo: Este trabalho aborda a implementação paralela da técnica Branch-and-Bound em problemas de otimização combinatoria, especificamente busca em grafos. E utilizado na implementação o modelo de programação paralela por troca de mensagens com o uso da biblioteca Parallel Virtual Machine (PVM) sobre o sistema operacional Linux em uma arquitetura multicomputador. E analisado o comportamento da técnica Branch-and-Bound, em particular a relação entre (a) três critérios de busca, (b) a utilização dos recursos de memória e (c) granularidade de, processamento e comunicação entre processos. E propos

APA, Harvard, Vancouver, ISO, and other styles

7

Abdul-Razaq, Tariq S. "Machine scheduling problems : a branch and bound approach." Thesis, Keele University, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328587.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mutlu, Mustafa Cagdas. "A Branch And Bound Algorithm For Resource Leveling Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612259/index.pdf.

Full text

Abstract:

Resource Leveling Problem (RLP) aims to minimize undesired fluctuations in resource distribution curves which cause several practical problems. Many studies conclude that commercial project management software packages can not effectively deal with RLP. In this study a branch and bound algorithm is presented for solving RLP for single and multi resource, small size networks. The algorithm adopts a depth-first strategy and stores start times of non-critical activities in the nodes of the search tree. Optimal resource distributions for 4 different types of resource leveling metrics can be obtain

APA, Harvard, Vancouver, ISO, and other styles

9

Stix, Volker. "Target oriented branch & bound method for global optimization." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1696/1/document.pdf.

Full text

Abstract:

We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule. The latter reduces the problem into several smaller subproblems of the same type. The new B&B approach delivers one global optimizer or, if stopped before finished, improved upper and lower bounds for the problem. Its main difference to commonly used B&B techniques is its ability to approximate the problem from above and from below while traversing the problem tre

APA, Harvard, Vancouver, ISO, and other styles

10

Eele, Alison. "Path Planning with Avoidance Using Nonlinear Branch-and-Bound." Thesis, University of Bristol, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.520189.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Branch and bound"

1

Turpin, Heather Jane. The branch-and-bound paradigm. University of East Anglia, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kedia, Pradeep. Optimal solution of set covering problems using dual heuristics. Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Management, Purdue University, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Moursli, Omar. Scheduling the hybrid flowshop: Branch and bound algorithms. CIACO, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brusco, Michael. Branch-and-bound applications in combinatorial data analysis. Springer, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Stephanie, Stahl, ed. Branch-and-bound applications in combinatorial data analysis. Springer, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

G, Kiselev V., ed. Metod resheni͡ia ͡tselochislennoĭ podzadachi Bendersa v nekotorykh zadachakh razmeshcheni͡ia proizvodstva. Vychislitelʹnyĭ ͡tsentr AN SSSR, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yanai, Shūzō. On a dominance test for a single machine scheduling problem with release dates to minimize total flow time. Institute of Economic Research, Kobe University of Commerce, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Xinghao, and Michael L. Bushnell. Efficient Branch and Bound Search with Application to Computer-Aided Design. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1329-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Rocktäschel, Stefan. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization. Springer Fachmedien Wiesbaden, 2020. http://dx.doi.org/10.1007/978-3-658-29149-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Xinghao. Efficient Branch and Bound Search with Application to Computer-Aided Design. Springer US, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Branch and bound"

1

Horst, Reiner, and Hoang Tuy. "Branch and Bound." In Global Optimization. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-662-02598-7_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Martí, Rafael, and Gerhard Reinelt. "Branch-and-Bound." In The Linear Ordering Problem. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16729-4_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gass, Saul I., and Carl M. Harris. "Branch And Bound." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_88.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shekhar, Shashi, and Hui Xiong. "Branch and Bound." In Encyclopedia of GIS. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fampa, Marcia, and Jon Lee. "Branch-and-bound." In Maximum-Entropy Sampling. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13078-6_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bosc, Patrick, Marc Guyomard, and Laurent Miclet. "Branch and bound." In Algorithm Design: A Methodological Approach - 150 problems and detailed solutions. Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/b23251-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Martí, Rafael, and Gerhard Reinelt. "Branch-and-Bound." In Exact and Heuristic Methods in Combinatorial Optimization. Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-662-64877-3_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Horst, Reiner, and Hoang Tuy. "Branch and Bound." In Global Optimization. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-02947-3_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Horst, Reiner, and Hoang Tuy. "Branch and Bound." In Global Optimization. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-662-03199-5_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Charon, Irène, and Olivier Hudry. "Branch-and-Bound Methods." In Concepts of Combinatorial Optimization. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118600245.ch3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Branch and bound"

1

Bertolino, Antonia, and Martina Marré. "A meaningful bound for branch testing." In the 1994 international symposium. ACM Press, 1994. http://dx.doi.org/10.1145/186258.187203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

"ALGORITHMIC SKELETONS FOR BRANCH & BOUND." In 1st International Conference on Software and Data Technologies. SciTePress - Science and and Technology Publications, 2006. http://dx.doi.org/10.5220/0001315002910300.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rass, Stefan, Peter Schartner, Raphael Wigoutschnigg, and Christian Kollmitzer. "Anonymous Communication by Branch-and-Bound." In 2012 Seventh International Conference on Availability, Reliability and Security (ARES). IEEE, 2012. http://dx.doi.org/10.1109/ares.2012.64.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Strawser, Daniel, and Brian Williams. "Approximate Branch and Bound for Fast, Risk-Bound Stochastic Path Planning." In 2018 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2018. http://dx.doi.org/10.1109/icra.2018.8461070.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Karp, Richard, and Yanjun Zhang. "A randomized parallel branch-and-bound procedure." In the twentieth annual ACM symposium. ACM Press, 1988. http://dx.doi.org/10.1145/62212.62240.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Pargas, R. P., and D. E. Wooster. "Branch-and-bound algorithms on a hypercube." In the third conference. ACM Press, 1988. http://dx.doi.org/10.1145/63047.63109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Talbi, El-Ghazali, Ahcene Bendjoudi, and Noredine Melab. "Parallel Branch and Bound on P2P Systems." In First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07). IEEE, 2007. http://dx.doi.org/10.1109/cisis.2007.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

"Optimal structure design using branch and bound." In Proceedings of the 1999 American Control Conference. IEEE, 1999. http://dx.doi.org/10.1109/acc.1999.786172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Binney, Jonathan, and Gaurav S. Sukhatme. "Branch and bound for informative path planning." In 2012 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2012. http://dx.doi.org/10.1109/icra.2012.6224902.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Jau-Yuen, Charles A. Bouman, and Jan P. Allebach. "Multiscale branch-and-bound image database search." In Electronic Imaging '97, edited by Ishwar K. Sethi and Ramesh C. Jain. SPIE, 1997. http://dx.doi.org/10.1117/12.263402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Branch and bound"

1

Subrahmanian, V. S., Dana Nau, and C. Vago. WFS + Branch and Bound = Stable Models. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada455012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Washburn, Alan R. Branch and Bound Methods for Search Problems. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada294522.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

ECKSTEIN, JONATHAN, WILLIAM E. HART, and CYNTHIA A. PHILLIPS. PICO: An Object-Oriented Framework for Branch and Bound. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/771506.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Balas, Egon, and Maria C. Carrera. A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada257416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Trienekens, Harry W. Parallel Branch and Bound on an MIMD (Multiple Instruction Stream, Multiple Data Stream) System. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada178816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Miller, D. L., J. F. Pekny, and G. L. Thompson. An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada237878.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Radvand, Tina, and Alireza Talebpour. A Quantum Optimization Algorithm for Optimal Electric Vehicle Charging Station Placement for Intercity Trips. Illinois Center for Transportation, 2024. https://doi.org/10.36501/0197-9191/24-028.

Full text

Abstract:

Electric vehicles (EVs) play a significant role in enhancing the sustainability of transportation systems. However, their widespread adoption is hindered by inadequate public charging infrastructure, particularly to support long-distance travel. Identifying optimal charging station locations in large transportation networks presents a well-known NP-hard combinatorial optimization problem, as the search space grows exponentially with the number of potential charging station locations. This report introduces a quantum search-based optimization algorithm designed to enhance the efficiency of solv

APA, Harvard, Vancouver, ISO, and other styles

8

Bassi, Andrea. From “Social Impact” to “Social Value”. CIRIEC, 2022. http://dx.doi.org/10.25518/ciriec.wp202206.

Full text

Abstract:

After the financial-economic crisis of 2008 there has been an increasing diffusion of discourses by international institutions stressing the necessity towards the adoption of impact evaluation methods both by for profit and SSE organizations. This craze for impact measurement is generally led by the need of the stock exchange to find new financial markets (demand) for an increasing offer of socially or environmentally oriented financial products (such as the Social Impact Bond). This pressure had the effect to spread terms and concept typically of the financial world to other domains, such as

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!