The DOI matches its Crossref record.
An Automatic Method of Solving Discrete Programming Problems
Abstract
I n the classical linear programming problem the behaviour of continuous, nonnegative variables subject to a system of linear inequalities is investigated.One possible generalization of this problem is to relax the continuity condition on the variables.This paper presents a simple numerical algorithm for the solution of programming problems in which some or all of the variables can take only discrete values.The algorithm requires no special techniques beyond those used in ordinary linear programming, and lends itself to automatic computing.Its use is illustrated on two ~lumerical examples.
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
A Review of Feature Selection and Its Methods
Venkatesh, B., & Anuradha, J. (2019) · Cybernetics and Information Technologies · doi:10.2478/cait-2019-0001 · Cited by 631
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Shang, H., Zhang, Y., Lin, X., & Yu, J. X. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453899 · Cited by 401
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Mixed Integer Linear Programming Formulation Techniques
Vielma, J. P. (2015) · SIAM Review · doi:10.1137/130915303 · Cited by 358
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Yu, J., & LaValle, S. M. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2593448 · Cited by 331
Metadata
- Authors
- Land, A. H., & Doig, A. G.
- Venue
- Econometrica
- Publisher
- JSTOR
- Published
- 1960-07
- Volume
- 28
- Issue
- 3
- Pages
- 497
- ISSN
- 0012-9682 (ISSN-L)
- OpenAlex
- W4240374930
- Cited by
- 1,942
- References
- 0
- FWCI
- 3.42
- 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: An Automatic Method of Solving Discrete Programming Problems. https://app.cochat.ai/papers/10.2307/1910129
- The paper
- Land, A. H., & Doig, A. G. (1960). An Automatic Method of Solving Discrete Programming Problems. Econometrica. https://doi.org/10.2307/1910129
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.
