The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A Primer in Column Generation
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
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Decomposition Principle for Linear Programs
Dantzig, G. B., & Wolfe, P. (1960) · Operations Research · doi:10.1287/opre.8.1.101 · Cited by 2,315
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
A Linear Programming Approach to the Cutting-Stock Problem
Gilmore, P. C., & Gomory, R. E. (1961) · Operations Research · doi:10.1287/opre.9.6.849 · Cited by 2,024
Optimization Theory of Large Systems
Lasdon, L. S., & Tabak, D. (1971) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1971.4308301 · Cited by 1,677
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
A Linear Programming Approach to the Cutting Stock Problem—Part II
Gilmore, P. C., & Gomory, R. E. (1963) · Operations Research · doi:10.1287/opre.11.6.863 · Cited by 1,119
Lagrangean relaxation for integer programming
Geoffrion, A. M. (1974) · Mathematical Programming Studies · doi:10.1007/bfb0120690 · Cited by 1,111
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Self-citationMathematical Methods of Organizing and Planning Production
Kantorovich, L. V. (1960) · Management Science · doi:10.1287/mnsc.6.4.366 · Cited by 1,082
Lagrangian Relaxation for Integer Programming
Geoffrion, A. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_9 · Cited by 974
Fleet Management and Logistics
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5755-5 · Cited by 485
Exact solution of bin‐packing problems using column generation and branch‐and‐bound
de Carvalho, J. V. (1999) · Annals of Operations Research · doi:10.1023/a:1018952112615 · Cited by 373
du Merle, O., Villeneuve, D. L., Desrosiers, J., & Hansen, P. (1999) · Discrete Mathematics · doi:10.1016/s0012-365x(98)00213-1 · Cited by 351
Self-citationA Suggested Computation for Maximal Multi-Commodity Network Flows
Ford, L. R., & Fulkerson, D. R. (2004) · Management Science · doi:10.1287/mnsc.1040.0269 · Cited by 326
A Suggested Computation for Maximal Multi-Commodity Network Flows
Ford, L. R., & Fulkerson, D. R. (1958) · Management Science · doi:10.1287/mnsc.5.1.97 · Cited by 325
Vanderbeck, F. (2000) · Operations Research · doi:10.1287/opre.48.1.111.12453 · Cited by 291
An exact algorithm for IP column generation
Vanderbeck, F., & Wolsey, L. A. (1996) · Operations Research Letters · doi:10.1016/0167-6377(96)00033-8 · Cited by 244
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M. M., Soumis, F., & Villeneuve, D. (1998) · Fleet Management and Logistics · doi:10.1007/978-1-4615-5755-5_3 · Cited by 238
Self-citationImplementing Mixed Integer Column Generation
Vanderbeck, F. (2006) · Springer eBooks · doi:10.1007/0-387-25486-2_12 · Cited by 164
On Compact Formulations for Integer Programs Solved by Column Generation
Villeneuve, D. L., Desrosiers, J., Lübbecke, M. E., & Soumis, F. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3455-9 · Cited by 60
Self-citation
Cited by
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Desaulniers, G., Errico, F., Irnich, S., & Schneider, M. (2016) · Operations Research · doi:10.1287/opre.2016.1535 · Cited by 497
Traffic Flow Prediction for Road Transportation Networks With Limited Traffic Data
Abadi, A., Rajabioun, T., & Ioannou, P. A. (2014) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2337238 · Cited by 338
On Dynamic Service Function Chain Deployment and Readjustment
Liu, J., Lu, W., Zhou, F., Lu, P., & Zhu, Z. (2017) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2017.2711610 · Cited by 315
Jia, Z., Sheng, M., Li, J., Niyato, D., & Han, Z. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3021255 · Cited by 271
Outpatient appointment scheduling given individual day-dependent no-show predictions
Samorani, M., & LaGanga, L. R. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.06.034 · Cited by 126
Metadata
- Authors
- Desrosiers, J., & Lübbecke, M. E.
- Venue
- Column Generation
- Publisher
- Springer-Verlag
- Published
- 2006-03-10
- Pages
- 1-32
- OpenAlex
- W2149335048
- Cited by
- 363
- References
- 25
- FWCI
- 27.30
- 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.