The DOI matches its Crossref record.
A tree-search algorithm for mixed integer programming problems
Abstract
This paper describes a new algorithm for finding solutions to optimization problems in which some of the variables must take integral values. The algorithm appears to offer some advantages over a similar algorithm proposed by Land and Doig, from which it was developed. The paper describes computational procedures which result in modest storage requirements. The method has been programmed and used to solve several problems.
Overview
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
Cited by
Lagrangean relaxation for integer programming
Geoffrion, A. M. (1974) · Mathematical Programming Studies · doi:10.1007/bfb0120690 · Cited by 1,111
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
Towards network-wide QoE fairness using openflow-assisted adaptive video streaming
Georgopoulos, P., Elkhatib, Y., Broadbent, M., Mu, M., & Race, N. (2013) · Proceedings of the 2013 ACM SIGCOMM workshop on Future human-centric multimedia networking · doi:10.1145/2491172.2491181 · Cited by 242
Metadata
- Authors
- Dakin, R. J.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1965-03-01
- Volume
- 8
- Issue
- 3
- Pages
- 250-255
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2033735555
- Cited by
- 640
- References
- 0
- FWCI
- 1.08
- 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: A tree-search algorithm for mixed integer programming problems. https://app.cochat.ai/papers/10.1093/comjnl/8.3.250
- The paper
- Dakin, R. J. (1965). A tree-search algorithm for mixed integer programming problems. The Computer Journal. https://doi.org/10.1093/comjnl/8.3.250
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.
