The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Lagrangean relaxation for integer programming
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
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
Validation of subgradient optimization
Held, M., Wolfe, P., & Crowder, H. P. (1974) · Mathematical Programming · doi:10.1007/bf01580223 · Cited by 1,362
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Everett, H. (1963) · Operations Research · doi:10.1287/opre.11.3.399 · Cited by 1,274
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
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
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
Self-citationDuality in Nonlinear Programming: A Simplified Applications-Oriented Development
Geoffrion, A. M. (1971) · SIAM Review · doi:10.1137/1013001 · Cited by 319
Self-citationLetter to the Editor—Finding Everett's Lagrange Multipliers by Linear Programming
Brooks, R., & Geoffrion, A. M. (1966) · Operations Research · doi:10.1287/opre.14.6.1149 · Cited by 59
Self-citation
Cited by
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
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
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
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
Jans, R., & Degraeve, Z. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.12.008 · Cited by 297
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Spatio-Temporal Coordinated V2V Energy Swapping Strategy for Mobile PEVs
Wang, M., Ismail, M., Zhang, R., Shen, X., Serpedin, E., & Qaraqe, K. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2593667 · Cited by 94
Toward Delay-Efficient Game-Aware Data Centers for Cloud Gaming
Amiri, M., Osman, H. A., Shirmohammadi, S., & Abdallah, M. (2016) · ACM Transactions on Multimedia Computing, Communications, and Applications · doi:10.1145/2983639 · Cited by 40
Metadata
- Authors
- Geoffrion, A. M.
- Venue
- Mathematical Programming Studies
- Publisher
- Springer Berlin Heidelberg
- Published
- 1974
- Pages
- 82-114
- ISSN
- 0303-3929 (ISSN-L)
- OpenAlex
- W4242130683
- Cited by
- 1,111
- References
- 8
- FWCI
- 20.43
- Type
- book chapter
- 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.
