CoChat
Cited by 1,102

The DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.

Selected Topics in Column Generation

Open access
Lübbecke, Marco E., Desrosiers, Jacques · 2005 · Operations Research

Abstract

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.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/opre.1050.0234

Cites

73 of 73 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 54

  1. Adler I., 1973, Decomposition of Large Scale Problems, 181
  2. 10.1002/net.3230190702 · doi:10.1002/net.3230190702
  3. Anbil R., 1998, Proc. Internat. Congress of Mathematicians Berlin, 677
  4. 10.1007/s101070050002 · doi:10.1007/s101070050002
  5. 10.1016/S0166-218X(01)00252-9 · doi:10.1016/s0166-218x(01)00252-9
  6. 10.1007/BF02680552 · DOI
  7. 10.1287/opre.44.6.852 · DOI
  8. 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
  9. Borndörfer R., 2003, Mathematics—Key Technology for the Future, 653
  10. 10.1287/opre.47.5.730 · DOI
  11. 10.1023/A:1019225027893 · DOI
  12. Chvátal V., 1983, Linear Programming
  13. Crainic T. G., 1987, Infor, 25, 136
  14. 10.1016/0377-2217(94)90122-8 · doi:10.1016/0377-2217(94)90122-8
  15. Desaulniers G., 2001, Essays and Surveys in Metaheuristics, 309
  16. 10.1287/opre.1050.0222 · DOI
  17. 10.1007/s10107-003-0469-4 · DOI
  18. 10.1023/A:1014998931654 · DOI
  19. 10.1007/BF01581089 · doi:10.1007/bf01581089
  20. 10.1080/1055678021000060829a · doi:10.1080/1055678021000060829a
  21. 10.1016/0377-2217(93)90129-B · doi:10.1016/0377-2217(93)90129-b
  22. 10.1007/BF01593804 · doi:10.1007/bf01593804
  23. 10.1007/BF01580108 · doi:10.1007/bf01580108
  24. Hiriart-Urruty J.-B., 1993, Convex Analysis and Minimization Algorithms, Part 2: Advanced Theory and Bundle Methods, 306
  25. 10.1016/0167-6377(84)90048-8 · doi:10.1016/0167-6377(84)90048-8
  26. 10.1016/0166-218X(88)90077-7 · doi:10.1016/0166-218x(88)90077-7
  27. 10.1080/02331939508844100 · doi:10.1080/02331939508844100
  28. 10.1007/s11766-997-0022-y · doi:10.1007/s11766-997-0022-y
  29. 10.1016/S0377-2217(98)00343-9 · DOI
  30. Irnich S., 2003, INFORMS J. Comput.
  31. 10.1016/0024-3795(91)90270-7 · doi:10.1016/0024-3795(91)90270-7
  32. 10.1016/S0305-0548(98)00101-4 · doi:10.1016/s0305-0548(98)00101-4
  33. 10.1007/3-540-48777-8_24 · doi:10.1007/3-540-48777-8_24
  34. 10.1007/3-540-45749-6_56 · doi:10.1007/3-540-45749-6_56
  35. 10.1287/trsc.37.2.183.15251 · DOI
  36. 10.1093/imamat/16.3.321 · doi:10.1093/imamat/16.3.321
  37. Mahey P., 1986, Proc. X. Sympos. Oper. Res., Part I: Sections 1–5. Methods in Operations Research, 697
  38. 10.1287/mnsc.46.5.693.12042 · doi:10.1287/mnsc.46.5.693.12042
  39. 10.1007/BFb0120702 · doi:10.1007/bfb0120702
  40. 10.1287/opre.23.3.389 · doi:10.1287/opre.23.3.389
  41. Minoux M., 1986, Mathematical Programming
  42. 10.1016/0024-3795(84)90186-1 · doi:10.1016/0024-3795(84)90186-1
  43. Nazareth J. L., 1987, Computer Solution of Linear Programs
  44. 10.1287/mnsc.42.9.1277 · doi:10.1287/mnsc.42.9.1277
  45. Poggi de Aragão M., 2003, Proc. Conf. Math. Program in Rio: A Conf. in Honour of Nelson Maculan, 56
  46. 10.1016/0377-2217(94)00150-B · doi:10.1016/0377-2217(94)00150-b
  47. Senne E. L. F., 2001, EURO 2001—The European Operational Res. Conference
  48. 10.1007/BF01580252 · doi:10.1007/bf01580252
  49. 10.1016/S0377-2217(02)00124-8 · DOI
  50. 10.1007/BF02591718 · doi:10.1007/bf02591718
  51. Vanderbeck F. Decomposition and column generation for integer programs. (1994) . Ph.D. thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium
  52. Villeneuve D. Logiciel de génération de colonnes. (1999) . Ph.D. thesis, École Polytechnique de Montréal, Montréal, Québec, Canada
  53. 10.1287/opre.17.2.368 · doi:10.1287/opre.17.2.368
  54. 10.1111/j.1475-3995.1997.tb00071.x · doi:10.1111/j.1475-3995.1997.tb00071.x

Cited by

See all 1,102

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
73
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

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.