The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Branch-and-Bound Methods: A Survey
Abstract
The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed. These include integer linear programming (Land-Doig and Balas methods), nonlinear programming (minimization of nonconvex objective functions), the traveling-salesman problem (Eastman and Little, et al. methods), and the quadratic assignment problem (Gilmore and Lawler methods). Computational considerations, including trade-offs between length of computation and storage requirements, are discussed and a comparison with dynamic programming is made. Various applications outside the domain of mathematical programming are also mentioned.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
Minimization of Boolean Functions*
McCluskey, E. J. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03835.x · Cited by 1,230
A Linear Programming Approach to the Cutting Stock Problem—Part II
Gilmore, P. C., & Gomory, R. E. (1963) · Operations Research · doi:10.1287/opre.11.6.863 · Cited by 1,119
An Algorithm for the Traveling Salesman Problem
Little, J. D. C., Murty, K. G., Sweeney, D. W., & Karel, C. (1963) · Operations Research · doi:10.1287/opre.11.6.972 · Cited by 1,058
The Quadratic Assignment Problem
Lawler, E. L. (1963) · Management Science · doi:10.1287/mnsc.9.4.586 · Cited by 964
Self-citationDynamic Programming Treatment of the Travelling Salesman Problem
Bellman, R. (1962) · Journal of the ACM · doi:10.1145/321105.321111 · Cited by 808
A tree-search algorithm for mixed integer programming problems
Dakin, R. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.3.250 · Cited by 640
Golomb, S. W., & Baumert, L. D. (1965) · Journal of the ACM · doi:10.1145/321296.321300 · Cited by 498
Cited by
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
A survey of decision tree classifier methodology
Safavian, S. R., & Landgrebe, D. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.97458 · Cited by 3,808
Babuška, R. (1998) · International Series in Intelligent Technologies · doi:10.1007/978-94-011-4868-9 · Cited by 1,318
Sensor Selection via Convex Optimization
Joshi, S., & Boyd, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007095 · Cited by 1,311
A Branch and Bound Algorithm for Feature Subset Selection
Narendra, & Fukunaga (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674939 · Cited by 1,245
A tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195
Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration
Yang, J., Li, H., Campbell, D., & Jia, Y. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2513405 · Cited by 1,170
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
Goel (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.1675757 · Cited by 1,122
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090
“One approach involves the construction of a state-space which is then searched with techniques similar to the branch and bound methods employed in operations research [3].”
MethodGeneralized best-first search strategies and the optimality of A*
Dechter, R., & Pearl, J. (1985) · Journal of the ACM · doi:10.1145/3828.3830 · Cited by 1,071
An analysis of alpha-beta pruning
Knuth, D. E., & Moore, R. W. (1975) · Artificial Intelligence · doi:10.1016/0004-3702(75)90019-3 · Cited by 1,004
The traveling salesman problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90138-y · Cited by 971
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
Mixed-integer nonlinear optimization
Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A. (2013) · Acta Numerica · doi:10.1017/s0962492913000032 · Cited by 712
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
Thrun, S., & Montemerlo, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906065387 · Cited by 689
Partial constraint satisfaction
Freuder, E. C., & Wallace, R. J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90004-h · Cited by 614
Evolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G
Liu, Y., Zhang, S., Mu, X., Ding, Z., Schober, R., Al-Dhahir, N., Hossain, E., & Shen, X. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3145234 · Cited by 595
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016) · Discrete Optimization · doi:10.1016/j.disopt.2016.01.005 · Cited by 563
Big data for cyber physical systems in industry 4.0: a survey
Xu, L. D., & Duan, L. (2019) · Enterprise Information Systems · doi:10.1080/17517575.2018.1442934 · Cited by 526
Schneidman-Duhovny, D., Hammel, M., Tainer, J. A., & Sali, A. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw389 · Cited by 517
Nurse rostering problems––a bibliographic survey
Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00021-3 · Cited by 498
Generation of fiducial marker dictionaries using Mixed Integer Linear Programming
Garrido-Jurado, S., Muñoz-Salinas, R., Madrid-Cuevas, F. J., & Medina-Carnicer, R. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2015.09.023 · Cited by 490
Heuristic search viewed as path finding in a graph
Pohl, I. (1970) · Artificial Intelligence · doi:10.1016/0004-3702(70)90007-x · Cited by 433
Chance-Constrained Optimal Path Planning With Obstacles
Blackmore, L., Ono, M., & Williams, B. C. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2161160 · Cited by 427
Artificial intelligence: foundations of computational agents
(2010) · Choice Reviews Online · doi:10.5860/choice.48-2130 · Cited by 415
A generalized S-D assignment algorithm for multisensor-multitarget state estimation
Deb, S., Yeddanapudi, M., Pattipati, K., & Bar-Shalom, Y. (1997) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.575891 · Cited by 415
Resource allocation for device-to-device communications underlaying LTE-advanced networks
Phunchongharn, P., Hossain, E., & Kim, D. I. (2013) · IEEE Wireless Communications · doi:10.1109/mwc.2013.6590055 · Cited by 403
Filtered beam search in scheduling†
OW, P. S., & MORTON, T. E. (1988) · International Journal of Production Research · doi:10.1080/00207548808947840 · Cited by 393
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Geoffrion, A. M., & Marsten, R. E. (1972) · Management Science · doi:10.1287/mnsc.18.9.465 · Cited by 350
Efficient Subwindow Search: A Branch and Bound Framework for Object Localization
Lampert, C. H., Blaschko, M. B., & Hofmann, T. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.144 · Cited by 344
Branch-and-Bound Methods: General Formulation and Properties
Mitten, L. G. (1970) · Operations Research · doi:10.1287/opre.18.1.24 · Cited by 336
Systems biology: parameter estimation for biochemical models
Ashyraliyev, M., Fomekong‐Nanfack, Y., Kaandorp, J. A., & Blom, J. G. (2009) · The FEBS Journal · doi:10.1111/j.1742-4658.2008.06844.x · Cited by 323
Pressey, R. L., Possingham, H. P., & Day, J. R. (1997) · Biological Conservation · doi:10.1016/s0006-3207(96)00045-6 · Cited by 323
Automatically generating personalized user interfaces with Supple
Gajos, K. Z., Weld, D. S., & Wobbrock, J. O. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.05.005 · Cited by 317
“To find a globally optimal solution, we use an algorithm that combines branch-andbound search [47,55] with constraint satisfaction techniques.”
MethodExperiences with the Amoeba Distributed Operating System
Tanenbaum, A. S., Renesse, R. V., Staveren, H. V., Sharp, G. J., Mullender, S. J., Jansen, J., & Rossum, G. V. (2001) · Classic Operating Systems · doi:10.1007/978-1-4757-3510-9_25 · Cited by 311
A Real-Time Charging Scheme for Demand Response in Electric Vehicle Parking Station
Yao, L., Lim, W. H., & Tsai, T. S. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2582749 · Cited by 304
A Survey of Algorithmic Recourse: Contrastive Explanations and Consequential Recommendations
Karimi, A.-H., Barthe, G., Schölkopf, B., & Valera, I. (2023) · ACM Computing Surveys · doi:10.1145/3527848 · Cited by 301
Optimality in reserve selection algorithms: When does it matter and how much?
Pressey, R. L., Possingham, H. P., & Margules, C. R. (1996) · Biological Conservation · doi:10.1016/0006-3207(95)00120-4 · Cited by 300
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Matai, R., Singh, S., & Lal, M. (2010) · Traveling Salesman Problem, Theory and Applications · doi:10.5772/12909 · Cited by 299
Particle swarm optimization for integer programming
Laskari, E. C., Parsopoulos, K. E., & Vrahatis, M. N. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004478 · Cited by 299
Patterns in pattern recognition: 1968-1974
Kanal, L. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055306 · Cited by 284
A new relaxation algorithm and passive sensor data association
Pattipati, K. R., Deb, S., Bar-Shalom, Y., & Washburn, R. B. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.121621 · Cited by 280
A Survey on Task Offloading in Multi-access Edge Computing
Islam, A., Debnath, A., Ghose, M., & Chakraborty, S. (2021) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2021.102225 · Cited by 271
Accelerating critical section execution with asymmetric multi-core architectures
Suleman, M. A., Mutlu, O., Qureshi, M. K., & Patt, Y. N. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508274 · Cited by 270
Bilocal versus nonbilocal correlations in entanglement-swapping experiments
Branciard, C., Rosset, D., Gisin, N., & Pironio, S. (2012) · Physical Review A · doi:10.1103/physreva.85.032119 · Cited by 258
Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks
Madan, R., Cui, S., Lall, S., & Goldsmith, A. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.04770 · Cited by 253
Kazmi, H., Mehmood, F., Lodeweyckx, S., & Driesen, J. (2018) · Energy · doi:10.1016/j.energy.2017.12.019 · Cited by 109
Designing Co-Creative AI for Public Spaces
Long, D., Jacob, M., & Magerko, B. (2019) · Proceedings of the 2019 on Creativity and Cognition · doi:10.1145/3325480.3325504 · Cited by 70
“Branch and bound search [50] can be used to aggressively prune the agent’s search space as it looks for a suitable solution.”
BackgroundOptimal Operation Strategy for Biohydrogen Production
del Rio-Chanona, E. A., Dechatiwongse, P., Zhang, D., Maitland, G. C., Hellgardt, K., Arellano-Garcia, H., & Vassiliadis, V. S. (2015) · Industrial & Engineering Chemistry Research · doi:10.1021/acs.iecr.5b00612 · Cited by 38
Quantum computing and supervised machine learning
Oneto, L., Ridella, S., & Anguita, D. (2017) · Quantum Inspired Computational Intelligence · doi:10.1016/b978-0-12-804409-4.00002-4 · Cited by 11
Metadata
- Authors
- Lawler, E. L., & Wood, D. E.
- Venue
- Operations Research
- Published
- 1966-08
- Volume
- 14
- Issue
- 4
- Pages
- 699-719
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2144931885
- Cited by
- 1,997
- References
- 14
- FWCI
- 19.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.