The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Selected Topics in Column Generation
Open accessAbstract
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large-scale integer programming. We outline and relate the approaches, and survey mainly recent contributions, not yet found in textbooks. We emphasize the growing understanding of the dual point of view, which has brought considerable progress to the column generation theory and practice. It stimulated careful initializations, sophisticated solution techniques for the restricted master problem and subproblem, as well as better overall performance. Thus, the dual perspective is an ever recurring concept in our “selected topics.”
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
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Marquardt, D. W. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111030 · Cited by 30,728
Resource Constrained Shortest Paths
Mehlhorn, K., & Ziegelmann, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45253-2_30 · Cited by 124
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Research works printed but not linked: 114
- Adler I., 1973, Decomposition of Large Scale Problems, 181
- 10.1002/net.3230190702 · doi:10.1002/net.3230190702
- Anbil R., 1998, Proc. Internat. Congress of Mathematicians Berlin, 677
- 10.1007/s101070050002 · doi:10.1007/s101070050002
- 10.1016/S0166-218X(01)00252-9 · doi:10.1016/s0166-218x(01)00252-9
- 10.1007/BF02680552 · doi:10.1007/bf02680552
- 10.1287/opre.44.6.852 · doi:10.1287/opre.44.6.852
- 10.1007/978-3-642-59179-2_2 · DOI
- 10.1287/opre.48.2.318.12378 · DOI · Paper page
- 10.1287/opre.46.3.316 · DOI · Paper page
- 10.1287/trsc.32.3.208 · DOI · Paper page
- Ben Amor H. Stabilisation de l’algorithme de génération de colonnes. (2002) . Ph.D. thesis, École Polytechnique de Montréal, Montréal, Québec, Canada
- 10.1007/BF01386316 · DOI · Paper page
- 10.1287/opre.50.1.3.17780 · DOI · Paper page
- 10.1287/opre.40.5.885 · DOI
- Borndörfer R., 2003, Mathematics—Key Technology for the Future, 653
- 10.1016/S0167-6377(96)00038-7 · DOI
- 10.1287/opre.47.5.730 · doi:10.1287/opre.47.5.730
- 10.1023/A:1019225027893 · doi:10.1023/a:1019225027893
- 10.1016/S0377-2217(96)00196-8 · DOI
- Chvátal V., 1983, Linear Programming
- Crainic T. G., 1987, Infor, 25, 136
- 10.1016/0377-2217(94)90122-8 · doi:10.1016/0377-2217(94)90122-8
- 10.1287/opre.8.1.101 · DOI · Paper page
- Desaulniers G., 2001, Essays and Surveys in Metaheuristics, 309
- 10.1287/mnsc.43.6.841 · DOI · Paper page
- Desaulniers G., 2001, The Vehicle Routing Problem
- 10.1007/978-1-4615-5755-5_3 · DOI
- 10.1287/trsc.23.1.1 · DOI · Paper page
- 10.1287/opre.40.2.342 · DOI · Paper page
- 10.1002/net.3230140406 · DOI · Paper page
- 10.1016/S0927-0507(05)80106-9 · DOI · Paper page
- 10.1016/S0012-365X(98)00213-1 · DOI
- 10.1287/opre.44.1.65 · DOI
- 10.1287/opre.1050.0222 · doi:10.1287/opre.1050.0222
- 10.1007/s10107-003-0469-4 · doi:10.1007/s10107-003-0469-4
- 10.1023/A:1014998931654 · doi:10.1023/a:1014998931654
- 10.1287/opre.38.5.922 · DOI
- 10.1287/mnsc.5.1.97 · DOI · Paper page
- 10.1007/BF01581089 · doi:10.1007/bf01581089
- 10.1287/opre.47.2.247 · DOI
- 10.1287/trsc.32.3.246 · DOI
- 10.1007/BFb0120690 · DOI · Paper page
- 10.1287/opre.9.6.849 · DOI · Paper page
- 10.1287/opre.11.6.863 · DOI · Paper page
- 10.1080/1055678021000060829a · doi:10.1080/1055678021000060829a
- 10.1016/0377-2217(93)90129-B · doi:10.1016/0377-2217(93)90129-b
- 10.1007/BF01593804 · doi:10.1007/bf01593804
- 10.1007/978-3-642-97881-4 · DOI · Paper page
- 10.1016/S0377-2217(97)00059-3 · DOI
- 10.1007/BF01580108 · doi:10.1007/bf01580108
- Hiriart-Urruty J.-B., 1993, Convex Analysis and Minimization Algorithms, Part 2: Advanced Theory and Bundle Methods, 306
- 10.1016/0167-6377(84)90048-8 · doi:10.1016/0167-6377(84)90048-8
- 10.1016/0166-218X(88)90077-7 · doi:10.1016/0166-218x(88)90077-7
- 10.1080/02331939508844100 · doi:10.1080/02331939508844100
- 10.1007/s11766-997-0022-y · doi:10.1007/s11766-997-0022-y
- 10.1016/S0377-2217(98)00343-9 · doi:10.1016/s0377-2217(98)00343-9
- 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A · doi:10.1002/(sici)1097-0037(199805)31:3<193::aid-net6>3.0.co;2-a
- Irnich S., 2003, INFORMS J. Comput.
- 10.1007/978-3-642-83724-1_1 · DOI
- 10.1007/BF01585164 · DOI · Paper page
- 10.1287/mnsc.6.4.366 · DOI · Paper page
- 10.1137/0108053 · DOI · Paper page
- 10.1016/0024-3795(91)90270-7 · doi:10.1016/0024-3795(91)90270-7
- 10.1016/S0305-0548(98)00101-4 · doi:10.1016/s0305-0548(98)00101-4
- 10.1007/3-540-48777-8_24 · doi:10.1007/3-540-48777-8_24
- 10.1287/opre.45.3.395 · DOI
- 10.1287/trsc.33.1.101 · DOI
- 10.1007/3-540-45749-6_56 · doi:10.1007/3-540-45749-6_56
- Lasdon L. S., 1970, Optimization Theory for Large Systems
- Löbel A. Optimal vehicle scheduling in public transit. (1997) . Ph.D. thesis, Technische Universität Berlin, Berlin, Germany
- 10.1287/mnsc.44.12.1637 · DOI
- 10.1287/trsc.37.2.183.15251 · doi:10.1287/trsc.37.2.183.15251
- 10.1093/imamat/16.3.321 · doi:10.1093/imamat/16.3.321
- Mahey P., 1986, Proc. X. Sympos. Oper. Res., Part I: Sections 1–5. Methods in Operations Research, 697
- 10.1287/mnsc.46.5.693.12042 · doi:10.1287/mnsc.46.5.693.12042
- 10.1007/BFb0120702 · doi:10.1007/bfb0120702
- 10.1287/opre.23.3.389 · doi:10.1287/opre.23.3.389
- 10.1287/ijoc.8.4.344 · DOI · Paper page
- Minoux M., 1986, Mathematical Programming
- 10.1051/ro/1987210201051 · DOI
- 10.1016/0024-3795(84)90186-1 · doi:10.1016/0024-3795(84)90186-1
- Nazareth J. L., 1987, Computer Solution of Linear Programs
- 10.1002/9781118627372 · DOI · Paper page
- 10.1287/mnsc.42.9.1277 · doi:10.1287/mnsc.42.9.1277
- Poggi de Aragão M., 2003, Proc. Conf. Math. Program in Rio: A Conf. in Honour of Nelson Maculan, 56
- 10.1287/opre.42.1.41 · DOI
- 10.1016/0377-2217(89)90389-5 · DOI
- Ryan D. M., 1981, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, 269
- 10.1016/0377-2217(94)00150-B · doi:10.1016/0377-2217(94)00150-b
- 10.1287/opre.45.6.831 · DOI · Paper page
- 10.1287/opre.46.4.474 · DOI · Paper page
- Schrijver A., 1986, Theory of Linear and Integer Programming
- Senne E. L. F., 2001, EURO 2001—The European Operational Res. Conference
- Sol M. Column generation techniques for pickup and delivery problems. (1994) . Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands
- Soumis F., 1997, Annotated Bibliographies in Combinatorial Optimization, 115
- 10.1007/BF01580252 · doi:10.1007/bf01580252
- 10.1023/A:1018952112615 · DOI
- 10.1016/S0377-2217(02)00124-8 · doi:10.1016/s0377-2217(02)00124-8
- 10.1023/A:1013733421344 · DOI
- 10.1007/BF02591718 · doi:10.1007/bf02591718
- 10.1023/A:1018346107246 · DOI
- 10.1007/BF01300970 · DOI
- Vanderbeck F. Decomposition and column generation for integer programs. (1994) . Ph.D. thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium
- 10.1007/s101070050105 · DOI
- 10.1287/opre.48.1.111.12453 · DOI · Paper page
- 10.1007/0-387-25486-2_12 · DOI
- 10.1016/0167-6377(96)00033-8 · DOI
- Villeneuve D. Logiciel de génération de colonnes. (1999) . Ph.D. thesis, École Polytechnique de Montréal, Montréal, Québec, Canada
- 10.1007/s10479-005-3455-9 · DOI
- 10.1287/opre.17.2.368 · doi:10.1287/opre.17.2.368
- 10.1007/BF02099703 · DOI
- 10.1111/j.1475-3995.1997.tb00071.x · doi:10.1111/j.1475-3995.1997.tb00071.x
- Wolsey L. A., 1998, Integer Programming
Cited by
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Robust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70
A survey of the literature on airline crew scheduling
Deveci, M., & Demirel, N. Ç. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.05.008 · Cited by 71
Pippia, T., Sijs, J., & De Schutter, B. (2020) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2945023 · Cited by 58
Metadata
- Authors
- Lübbecke, M. E., & Desrosiers, J.
- Venue
- Operations Research
- Published
- 2005-12
- Volume
- 53
- Issue
- 6
- Pages
- 1007-1023
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1970355999
- Cited by
- 1,102
- References
- 3
- FWCI
- 34.79
- Type
- journal article
- Language
- en
- Open access
- green
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: Selected Topics in Column Generation. https://app.cochat.ai/papers/10.1287/opre.1050.0234
- The paper
- Lübbecke, M. E., & Desrosiers, J. (2005). Selected Topics in Column Generation. Operations Research. https://doi.org/10.1287/opre.1050.0234
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.