The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
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
Cites
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
Cited by
Primer3—new capabilities and interfaces
Untergasser, A., Cutcutache, I., Koressaar, T., Ye, J., Faircloth, B. C., Remm, M., & Rozen, S. G. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks596 · Cited by 9,461
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Real-time loop closure in 2D LIDAR SLAM
Hess, W., Kohler, D., Rapp, H., & Andor, D. (2016) · 2016 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2016.7487258 · Cited by 1,938
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
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
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
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
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
Recent Advances in Graph Partitioning
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_4 · Cited by 482
Dalponte, M., Bruzzone, L., & Gianelle, D. (2012) · Remote Sensing of Environment · doi:10.1016/j.rse.2012.03.013 · Cited by 472
Wealth, risk and activity choice: cattle in Western Tanzania
Dercon, S. (1998) · Journal of Development Economics · doi:10.1016/s0304-3878(97)00054-0 · Cited by 453
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
Tree Species Classification in Boreal Forests With Hyperspectral Data
Dalponte, M., Orka, H. O., Gobakken, T., Gianelle, D., & Naesset, E. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2216272 · Cited by 378
Dillon, T. S., Edwin, K. W., Kochs, H.-D., & Taud, R. J. (1978) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1978.354719 · Cited by 362
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
Feature selection methods for big data bioinformatics: A survey from the search perspective
Wang, L., Wang, Y., & Chang, Q. (2016) · Methods · doi:10.1016/j.ymeth.2016.08.014 · Cited by 331
A Review of Methodological Approaches for the Design and Optimization of Wind Farms
Herbert-Acero, J., Probst, O., Réthoré, P.-E., Larsen, G., & Castillo-Villar, K. (2014) · Energies · doi:10.3390/en7116930 · Cited by 311
Optimal and suboptimal reserve selection algorithms
Underhill, L. G. (1994) · Biological Conservation · doi:10.1016/0006-3207(94)90302-6 · Cited by 304
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Clarke, J., & Lapata, M. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2433 · Cited by 303
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
An Intelligent Home Energy Management System to Improve Demand Response
Ozturk, Y., Senthilkumar, D., Kumar, S., & Lee, G. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2235088 · Cited by 294
Li, Y., Yang, Z., Li, G., Mu, Y., Zhao, D., Chen, C., & Shen, B. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.09.211 · Cited by 277
Zhao, P., Tian, H., Qin, C., & Nie, G. (2017) · IEEE Access · doi:10.1109/access.2017.2710056 · Cited by 271
Design and fabrication of materials with desired deformation behavior
Bickel, B., Bächer, M., Otaduy, M. A., Lee, H. R., Pfister, H., Gross, M., & Matusik, W. (2010) · ACM Transactions on Graphics · doi:10.1145/1778765.1778800 · Cited by 259
Optimality in prioritizing conservation projects
Hanson, J. O., Schuster, R., Strimas‐Mackey, M., & Bennett, J. R. (2019) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13264 · Cited by 52
Fukushima, K., & Pollock, D. D. (2023) · Nature Ecology & Evolution · doi:10.1038/s41559-022-01932-7 · Cited by 55
Travel time optimization on multi-AGV routing by reverse annealing
Haba, R., Ohzeki, M., & Tanaka, K. (2022) · Scientific Reports · doi:10.1038/s41598-022-22704-0 · Cited by 43
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
- 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
- 1
- 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
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.