The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Grossman, P. (2009) · Discrete Mathematics for Computing · doi:10.1007/978-0-230-37405-8_1 · Cited by 8,834
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Decomposition Principle for Linear Programs
Dantzig, G. B., & Wolfe, P. (1960) · Operations Research · doi:10.1287/opre.8.1.101 · Cited by 2,315
Introduction to Algorithms, third edition
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009) · Cited by 2,309
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
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
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
The theory of dynamic programming
Bellman, R. (1954) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1954-09848-8 · Cited by 1,459
GRASP: a search algorithm for propositional satisfiability
Marques-Silva, J. P., & Sakallah, K. A. (1999) · IEEE Transactions on Computers · doi:10.1109/12.769433 · Cited by 1,374
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
Generalized 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
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
Algorithms for constraint-satisfaction problems: a survey
Kumar, V. (1992) · doi:10.1609/aimag.v13i1.976 · Cited by 874
Edmonds polytopes and a hierarchy of combinatorial problems
Chvátal, V. (1973) · Discrete Mathematics · doi:10.1016/0012-365x(73)90167-2 · Cited by 624
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P. D., Reis, M., Uchoa, E., & Werneck, R. F. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0644-x · Cited by 539
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E., & Pape, C. L. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0518-7 · Cited by 530
Golomb, S. W., & Baumert, L. D. (1965) · Journal of the ACM · doi:10.1145/321296.321300 · Cited by 498
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Savelsbergh, M. (1997) · Operations Research · doi:10.1287/opre.45.6.831 · Cited by 437
A Column Generation Approach for Graph Coloring
Mehrotra, A., & Trick, M. A. (1996) · INFORMS Journal on Computing · doi:10.1287/ijoc.8.4.344 · Cited by 410
Fischetti, M., Glover, F., & Lodi, A. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0570-3 · Cited by 398
A Computational Study of Search Strategies for Mixed Integer Programming
Linderoth, J., & Savelsbergh, M. W. P. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.173 · Cited by 376
MIPLIB 2010: Mixed Integer Programming Library version 5
Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., Danna, E., Gamrath, G., Gleixner, A. M., Heinz, S., et al. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0025-9 · Cited by 321
Wallace, M. (2004) · Lecture notes in computer science · doi:10.1007/b100482 · Cited by 296
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
Valid inequalities for mixed integer linear programs
Cornuéjols, G. (2007) · Mathematical Programming · doi:10.1007/s10107-006-0086-0 · Cited by 227
Mixed Integer Programming: Analyzing 12 Years of Progress
Achterberg, T., & Wunderling, R. (2013) · Facets of Combinatorial Optimization · doi:10.1007/978-3-642-38189-8_18 · Cited by 220
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Hernández–Pérez, H., & Salazar‐González, J. (2004) · Discrete Applied Mathematics · doi:10.1016/j.dam.2003.09.013 · Cited by 219
A feasibility pump heuristic for general mixed-integer problems
Bertacco, L., Fischetti, M., & Lodi, A. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.10.001 · Cited by 158
Chess 4.5: The Northwestern University Chess Program
Slate, D. J., & Atkin, L. R. (1988) · Springer eBooks · doi:10.1007/978-1-4757-1968-0_9 · Cited by 148
Ostrowski, J., Linderoth, J., Rossi, F., & Smriglio, S. (2009) · Mathematical Programming · doi:10.1007/s10107-009-0273-x · Cited by 147
Performance Variability in Mixed-Integer Programming
Lodi, A., & Tramontani, A. (2013) · doi:10.1287/educ.2013.0112 · Cited by 136
Practice and Theory of Automated Timetabling IV
Elkhyari, A., Guéret, C., & Jussien, N. (2003) · Lecture notes in computer science · doi:10.1007/b11828 · Cited by 122
Conflict analysis in mixed integer programming
Achterberg, T. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.10.006 · Cited by 110
The Power of Dominance Relations in Branch-and-Bound Algorithms
Ibaraki, T. (1977) · Journal of the ACM · doi:10.1145/322003.322010 · Cited by 106
Theoretical comparisons of search strategies in branch-and-bound algorithms
Ibaraki, T. (1976) · International Journal of Parallel Programming · doi:10.1007/bf00998631 · Cited by 106
Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
Phan, D. T. (2012) · Operations Research · doi:10.1287/opre.1110.1036 · Cited by 70
French, A. P., Robinson, A. C., & Wilson, J. (2001) · Journal of Heuristics · doi:10.1023/a:1011921025322 · Cited by 46
Could we use a million cores to solve an integer program?
Koch, T., Ralphs, T. K., & Shinano, Y. (2012) · Mathematical Methods of Operations Research · doi:10.1007/s00186-012-0390-9 · Cited by 45
Fischetti, M., & Monaci, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20807-2_15 · Cited by 29
Morrison, D. R., Sewell, E. C., & Jacobson, S. H. (2014) · arXiv (Cornell University) · Cited by 1
Self-citation
Cited by
An efficient optimization approach for designing machine learning models based on genetic algorithm
Hamdia, K. M., Zhuang, X., & Rabczuk, T. (2021) · Neural Computing and Applications · doi:10.1007/s00521-020-05035-x · Cited by 301
Hybrid approaches to optimization and machine learning methods: a systematic literature review
Azevedo, B. F., Rocha, A. M. A. C., & Pereira, A. I. (2024) · Machine Learning · doi:10.1007/s10994-023-06467-x · Cited by 291
Herman, D., Googin, C., Liu, X., Sun, Y., Galda, A., Safro, I., Pistoia, M., & Alexeev, Y. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00603-1 · Cited by 284
Pippia, T., Sijs, J., & De Schutter, B. (2020) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2945023 · Cited by 58
Top-Down Synthesis for Library Learning
Bowers, M., Olausson, T. X., Wong, L., Grand, G., Tenenbaum, J. B., Ellis, K., & Solar-Lezama, A. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3571234 · Cited by 33
Metadata
- Authors
- Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C.
- Venue
- Discrete Optimization
- Publisher
- Elsevier BV
- Published
- 2016-02
- Volume
- 19
- Pages
- 79-102
- ISSN
- 1572-5286 (ISSN-L)
- OpenAlex
- W2277678953
- Cited by
- 563
- References
- 52
- FWCI
- 24.47
- Type
- journal article
- Language
- en
- Open access
- bronze
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.