Multi-phase dynamic constraint aggregation for set partitioning type problems

Mathematical Programming

Volumn 123, Issue 2, 2010, Pages 345-370

  Elhallaoui, Issmail ^a   Metrane, Abdelmoutalib ^a   Soumis, François ^a   Desaulniers, Guy ^a  

^a GERAD   (Canada)

Author keywords

Degeneracy; Dynamic constraint aggregation; K incompatibility; Multi phase algorithm; Set partitioning

Indexed keywords

COMPUTATION TIME; DEGENERACY; DISJOINT SUBSETS; DRIVER SCHEDULING; DYNAMIC CONSTRAINT AGGREGATION; LINEAR RELAXATIONS; PHASE DYNAMICS; PRICING STRATEGY; SET PARTITIONING; SOLUTION PROCESS; SPEED-UPS; THEORETICAL RESULT;

ITERATIVE METHODS;

EID: 77949540223     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0254-5     Document Type: Article

References (28)

1. Balinski M.L., Gomory R.E.: A mutual primal-dual simplex method. In: Graves, R.L., Wolfe, P. (eds) Recent Advances in Mathematical Programming., pp. 17-28. McGraw-Hill, New York (1963)
2. M.L. Balinski R.E. Quandt 1964 On an integer program for a delivery problem Oper. Res. 12 300 304 10.1287/opre.12.2.300
3. R.G. Bland 1977 New finite pivoting rule for simplex method Math. Oper. Res. 2 103 107 0408.90050 10.1287/moor.2.2.103 459599
4. A. Charnes 1952 Optimality and degeneracy in linear programming Econometrica 20 160 170 0049.37903 10.2307/1907845 56264
5. J.-F. Cordeau G. Desaulniers N. Lingaya F. Soumis J. Desrosiers 2001 Simultaneous locomotive and car assignment at VIA Rail Canada Transp. Res. B 35 767 787 10.1016/S0191-2615(00)00022-9
6. G.B. Dantzig G.B. Orden P. Wolfe 1955 The generalized simplex method for minimizing a linear form under linear inequality restraints Pac. J. Math. 5 183 195 0064.39402 69584
7. M. Desrochers J. Desrosiers F. Soumis 1992 A new optimization algorithm for the vehicle routing problem with time Windows Oper. Res. 40 342 354 0749.90025 10.1287/opre.40.2.342 1162951
8. M. Desrochers F. Soumis 1988 A generalized permanent labeling algorithm for the shortest path problem with time Windows INFOR 26 191 212 0652.90097
9. M. Desrochers F. Soumis 1989 A column generation approach to the urban transit crew scheduling problem Transp. Sci. 23 1 13 0668.90043 10.1287/trsc.23.1.1
10. I. Elhallaoui D. Villeneuve F. Soumis G. Desaulniers 2005 Dynamic aggregation of set partitioning constraints in column generation Oper. Res. 53 632 645 1165.90604 10.1287/opre.1050.0222
11. R. Fletcher 1998 A new degeneracy method and steepest-edge-based conditioning for LP SIAM J. Optim. 8 1038 1059 0918.65042 10.1137/ S1052623494277470 1646118
12. T. Gal 1993 Degeneracy in optimization problems Ann. Oper. Res. 46/47 1 7 10.1007/BF02096255 1260010
13. M. Gamache F. Soumis G. Marquis J. Desrosiers 1999 A column generation approach for large scale aircrew rostering problems Oper. Res. 47 247 263 1041.90513 10.1287/opre.47.2.247
14. A.M. Geoffrion 1974 Lagrangean relaxation for integer programming Math. Program. Study 2 82 114 439172
15. F. Glover 1968 Surrogate constraints Oper. Res. 16 741 749 0165.22602 10.1287/opre.16.4.741 250670
16. D. Goldfarb J.K. Reid 1977 A practicable steepest-edge simplex algorithm Math. Program. 12 361 371 0443.90058 10.1007/BF01593804 452649
17. K. Haase G. Desaulniers J. Desrosiers 2001 Simultaneous vehicle and crew scheduling in urban mass transit systems Transp. Sci. 35 286 303 1069.90528 10.1287/trsc.35.3.286.10153
18. P.M. Harris 1973 Pivot selection methods of the devex LP code Math. Program. 5 1 28 0261.90031 10.1007/BF01580108
19. K.L. Hoffman M. Padberg 1993 Solving ariline crew scheduling problems by branch-and-cut Manage. Sci. 39 657 682 0783.90051 10.1287/mnsc.39.6.657
20. Irnich S., Desaulniers G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation., pp. 33-65. Springer, New York (2005)
21. R. Mendelssohn 1982 An iterative aggregation procedure for Markov decision process Oper. Res. 30 62 73 0481.90090 10.1287/opre.30.1.62 647400
22. P.-Q. Pan 1998 A basis deficiency-allowing variation of the simplex method for linear programming Comput. Math. Appl. 36 3 33 53 0941.90055 10.1016/S0898-1221(98)00127-8 1632403
23. D.F. Rogers R.D. Plante R.T. Wong J.R. Evans 1991 Aggregation and disaggregation techniques and methodology in optimization Oper. Res. 39 553 582 0729.90738 10.1287/opre.39.4.553 1131025
24. D.M. Ryan M. et Osborne 1988 On the solution of highly degenerate linear programmes Math. Program. 41 385 392 0651.90045 10.1007/BF01580776
25. C.M. Shetty R.W. Taylor 1987 Solving large-scale linear programs by aggregation Comput. Oper. Res. 14 385 393 0626.90057 10.1016/0305-0548(87)90035- 9 904148
26. T. Terlaky Z. Sushong 1993 Pivot rules for linear programming: a survey on recent theoretical developments Ann. Oper. Res. 46 203 233 10.1007/BF02096264 1260019
27. Villeneuve D.: Logiciel de Génération de Colonnes, Ph.D. Dissertation. Université de Montréal, Canada (1999)
28. P. Wolfe 1963 A technique for resolving degeneracy in LP SIAM J. 2 205 211 153485