New developments in the primal-dual column generation technique

European Journal of Operational Research

Volumn 224, Issue 1, 2013, Pages 41-51

  Gondzio, Jacek ^a   González Brevis, Pablo ^a   Munari, Pedro ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Column generation; Interior point methods; Linear programming

Indexed keywords

CAPACITATED LOT SIZING PROBLEM; COLUMN GENERATION; COMPUTATIONAL EXPERIMENT; CUTTING STOCK PROBLEM; FEASIBLE SET; INTEGER PROGRAMMING PROBLEMS; INTERIOR POINT; INTERIOR POINT METHODS; NUMBER OF ITERATIONS; NUMERICAL RESULTS; OPTIMAL SOLUTIONS; PRIMAL-DUAL; PRIMAL-DUAL INTERIOR POINT METHODS; RELATIVE PERFORMANCE; RUNNING TIME; SET-UP TIME; UNSTABLE BEHAVIOR; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

INTEGER PROGRAMMING; LARGE SCALE SYSTEMS; LINEAR PROGRAMMING;

OPTIMAL SYSTEMS;

EID: 84866729808     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.07.024     Document Type: Article

References (46)

1. M.E. Lübbecke, and J. Desrosiers Selected topics in column generation Operations Research 53 6 2005 1007 1023
2. F. Vanderbeck, and L.A. Wolsey Reformulation and decomposition of integer programs M. Jünger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, G. Rinaldi, L.A. Wolsey, 50 Years of Integer Programming 1958-2008 2010 Springer Berlin Heidelberg 431 502
3. F. Vanderbeck Implementing mixed integer column generation G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation 2005 Springer US 331 358
4. J. Gondzio, R. Sarkissian, Column generation with a primal-dual method, Technical Report 96.6, Logilab, 1996.
5. R.K. Martinson, and J. Tind An interior point method in Dantzig-Wolfe decomposition Computers and Operation Research 26 1999 1195 1216
6. H. Ben Amor, and J. Valério de Carvalho Cutting stock problems G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation 2005 Springer US 131 161
7. B. Kallehauge, J. Larsen, O.B. Madsen, and M.M. Solomon Vehicle routing problem with time windows G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation 2005 Springer US 67 98
8. Z. Degraeve, and R. Jans A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times Operations Research 55 5 2007 909 920
9. R.E. Marsten, W.W. Hogan, and J.W. Blankenship The boxstep method for large-scale optimization Operations Research 23 3 1975 389 405
10. O. du Merle, D. Villeneuve, J. Desrosiers, and P. Hansen Stabilized column generation Discrete Mathematics 194 1-3 1999 229 237
11. O. Briant, C. Lemaréchal, P. Meurdesoif, S. Michel, N. Perrot, and F. Vanderbeck Comparison of bundle and classical column generation Mathematical Programming 113 2008 299 344
12. L.-M. Rousseau, M. Gendreau, and D. Feillet Interior point stabilization for column generation Operations Research Letters 35 5 2007 660 668
13. H.M.T. Ben Amor, J. Desrosiers, and A. Frangioni On the choice of explicit stabilizing terms in column generation Discrete Applied Mathematics 157 6 2009 1167 1184
14. J.E. Mitchell, and B. Borchers Solving real-world linear ordering problems using a primal-dual interior point cutting plane method Annals of Operations Research 62 1996 253 276
15. J.E. Mitchell Computational experience with an interior point cutting plane algorithm SIAM Journal of Optimization 10 4 2000 1212 1227
16. J.L. Goffin, A. Haurie, and J.P. Vial Decomposition and nondifferentiable optimization with the projective algorithm Management Science 38 2 1992 284 302
17. D.S. Atkinson, and P.M. Vaidya A cutting plane algorithm for convex programming that uses analytic centers Mathematical Programming 69 1995 1 43
18. J.-L. Goffin, and J.-P. Vial Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method Optimization Methods and Software 17 2002 805 868
19. J.E. Mitchell Polynomial interior point cutting plane methods Optimization Methods and Software 18 5 2003 507 534
20. F. Babonneau, C. Beltran, A. Haurie, C. Tadonki, and J.-P. Vial Proximal-ACCPM: a versatile oracle based optimisation method E.J. Kontoghiorghes, C. Gatu, H. Amman, B. Rustem, C. Deissenberg, A. Farley, M. Gilli, D. Kendrick, D. Luenberger, R. Maes, I. Maros, J. Mulvey, A. Nagurney, S. Nielsen, L. Pau, E. Tse, A. Whinston, Optimisation, Econometric and Financial Analysis Advances in Computational Management Science vol. 9 2007 Springer Berlin Heidelberg 67 89
21. S.J. Wright Primal-Dual Interior-Point Methods 1997 SIAM
22. J. Gondzio Interior point methods 25 years later European Journal of Operational Research 218 3 2012 587 601
23. J. Gondzio HOPDM (version 2.12) - a fast LP solver based on a primal-dual interior point method European Journal of Operational Research 85 1995 221 225
24. J. Gondzio Warm start of the primal-dual method applied in the cutting-plane scheme Mathematical Programming 83 1998 125 143
25. M. Colombo, and J. Gondzio Further development of multiple centrality correctors for interior point methods Computational Optimization and Applications 41 3 2008 277 305
26. J. Gondzio, and A. Grothey Reoptimization with the primal-dual interior point method SIAM Journal on Optimization 13 3 2003 842 864
27. J. Gondzio, and A. Grothey A new unblocking technique to warmstart interior point methods based on sensitivity analysis SIAM Journal on Optimization 19 3 2008 1184 1210
28. IBM ILOG CPLEX v.12.1, Using the CPLEX Callable Library, 2010.
29. COIN-OR, OBOE: the Oracle Based Optimization Engine, 2010. < http://projects.coin-or.org/OBOE > (accessed 02.10.10).
30. G.B. Dantzig, and P. Wolfe Decomposition principle for linear programs Operations Research 8 1 1960 101 111
31. F. Vanderbeck On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm Operations Research 48 1 2000 111 128
32. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance Branch-and-price: column generation for solving huge integer programs Operations Research 46 3 1998 316 329
33. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting-stock problem Operations Research 9 6 1961 849 859
34. E. Falkenauer A hybrid grouping genetic algorithm for bin packing Journal of Heuristics 2 1996 5 30
35. A.A.S. Leão, Geração de colunas para problemas de corte em duas fases, Master's thesis, ICMC - University of Sao Paulo, Brazil, 2009.
36. M. Desrochers, J. Desrosiers, and M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 2 1992 342 354
37. S. Irnich, and G. Desaulniers Shortest path problems with resource constraints G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation 2005 Springer US 33 65
38. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
39. G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 3 2008 155 170
40. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle-routing problems Networks 44 2004 216 229
41. J. Homberger, and H. Gehring A two-phase hybrid metaheuristic for the vehicle routing problem with time windows European Journal of Operational Research 162 1 2005 220 238
42. W.W. Trigeiro, L.J. Thomas, and J.O. McClain Capacitated lot sizing with setup times Management Science 35 3 1989 353 366
43. R. Jans, and Z. Degraeve Improved lower bounds for the capacitated lot sizing problem with setup times Operations Research Letters 32 2 2004 185 195
44. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Management Science 5 1 1958 89 96
45. A. Frangioni Generalized bundle methods SIAM Journal on Optimization 13 2002 117 156
46. F. Barahona, and R. Anbil The volume algorithm: producing primal solutions with a subgradient method Mathematical Programming 87 2000 385 399