The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Branch-and-Bound Methods: General Formulation and Properties
Abstract
The branch-and-bound procedure is formulated in rather general terms and necessary conditions for the branching and bounding functions are precisely specified. Results include the standard properties for finite procedures, plus several convergence conditions for infinite procedures. Discrete programming which includes integer programming and combinatorial optimization problems, is discussed and Fibonacci search is presented as an example of a nonfinite branch-and-bound procedure employing an optimal convergence rule.
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
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 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
Buehler, R. J., & Wilde, D. J. (1965) · Econometrica · doi:10.2307/1909808 · Cited by 695
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
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
Gilmore, P. C. (1962) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0110022 · Cited by 448
Optimum Seeking with Branch and Bound
Agin, N. (1966) · Management Science · doi:10.1287/mnsc.13.4.b176 · Cited by 111
Cited by
Babuška, R. (1998) · International Series in Intelligent Technologies · doi:10.1007/978-94-011-4868-9 · Cited by 1,318
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
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
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
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.”
Method
Metadata
- Authors
- Mitten, L. G.
- Venue
- Operations Research
- Published
- 1970-02
- Volume
- 18
- Issue
- 1
- Pages
- 24-34
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2103054960
- Cited by
- 336
- References
- 8
- FWCI
- 6.49
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Branch-and-Bound Methods: General Formulation and Properties. https://app.cochat.ai/papers/10.1287/opre.18.1.24
- The paper
- Mitten, L. G. (1970). Branch-and-Bound Methods: General Formulation and Properties. Operations Research. https://doi.org/10.1287/opre.18.1.24
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.