Column generation based primal heuristics

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 695-702

  Joncour, C ^a,c   Michel, S ^b   Sadykov, R ^a,c   Sverdlov, D ^c   Vanderbeck, F ^a,c  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b UNIVERSITÉ DU HAVRE   (France)

^c INRIA   (France)

Author keywords

Column Generation; Primal Heuristic

Indexed keywords

EID: 77954894235     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.088     Document Type: Article

References (23)

1. Achterberg Tobias, Berthold Timo Improving the feasibility pump. Discrete Optim. 2007, 4(1):77-86.
2. Agarwal Y., Mathur K., Salkin H.M. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 1989, 19(7):731-749.
3. Ahuja Ravindra K., Ergun Özlem, Orlin James B., Punnen Abraham P. A survey of very large-scale neighborhood search techniques. Discrete Appl.Math. 2002, 123(1-3):75-102.
4. Belov G., Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European J. Oper. Res. 2002, 141(2):274-294. Cutting and packing.
5. Timo Berthold. Primal Heuristics for Mixed Integer Programs. Master's thesis, Technische Universität Berlin, 2006.
6. A. Chabrier. Heuristic branch-and-price-and-cut to solve a network design problem. In Proceedings CPAIOR, Montreal, Canada, may 2003.
7. A. Chabrier, E. Danna, and C. Le Pape. Coopération entre génération de colonnes et recherche locale appliquées au problème de routage de véhicules. In Huitièmes Journées Nationales sur la résolution de Problèmes NP-Complets (JNPC), pages 83-97, Nice, France, may 2002.
8. Danna Emilie, Rothberg Edward, Le Pape Claude Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program Ser. A 2005, 102(1):71-90.
9. Degraeve Zeger, Raf Jans A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 2007, 55(5):909-920.
10. Fernandes Muritiba Albert E., Iori Manuel, Malaguti Enrico, Toth Paolo Algorithms for the bin packing problem with conflicts. INFORMS Journal on Computing 2009, 10.1287/ijoc.1090.0355.
11. Fischetti Matteo, Glover Fred, Lodi Andrea The feasibility pump. Math.Program. Ser. A 2005, 104(1):91-104.
12. Fischetti Matteo, Lodi Andrea Local branching. Math. Program. Ser. B 2003, 98(1-3):23-47.
13. Gamache Michel, Soumis François, Marquis Gérald, Desrosiers Jacques A column generation approach for large-scale aircrew rostering problems. Oper. Res. 1999, 47(2):247-263.
14. Grötschel Martin, Borndörfer Ralf, Löbel Andreas Duty scheduling in public transit. Mathematics-key technology for the future. Joint projects between universities and industry 2003, 653-674. Springer, Berlin. W. Jäger (Ed.).
15. Gunluk Oktay, Kimbrel Tracy, Ladanyi Laszlo, Schieber Baruch, Sorkin Gregory B. Vehicle Routing and Staffing for Sedan Service. Transportation Science 2006, 40(3):313-326.
16. Harvey William D., Ginsberg Matthew L. Limited discrepancy search. Proc. IJCAI-95 1995, 607-613. Morgan Kaufmann, Montreal, Quebec.
17. Kiwiel Krzysztof C. An Inexact Bundle Approach to Cutting-Stock Problems. INFORMS Journal on Computing 2009, 10.1287/ijoc.1090.0326.
18. Sophie Michel. Optimisation des tournées de véhicules combinées à la gestion de stock. PhD thesis, Université Bordeaux 1, France, 2006.
19. Nancy Perrot. Integer Programming Column Generation Strategies for the Cutting Stock Problem and its Variants. PhD thesis, Université Bordeaux 1, France, 2005.
20. Taillard É.D. A heuristic column generation method for the heterogeneous fleet VRP. RO Oper. Res. 1999, 33(1):1-14.
21. Vanderbeck F. Bapcod - a generic branch-and-price code http://wiki.bordeaux.inria.fr/realopt/.
22. Vanderbeck François Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Program. Ser. A 1999, 86(3):565-594.
23. Vanderbeck François Branching in branch-and-price: a generic scheme. Mathematical Programming 2010, 10.1007/s10107-009-0334-1.