{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:43:23Z","timestamp":1781552603660,"version":"3.54.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T00:00:00Z","timestamp":1226620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10107-008-0254-5","type":"journal-article","created":{"date-parts":[[2008,11,13]],"date-time":"2008-11-13T12:17:27Z","timestamp":1226578647000},"page":"345-370","source":"Crossref","is-referenced-by-count":34,"title":["Multi-phase dynamic constraint aggregation for set partitioning type problems"],"prefix":"10.1007","volume":"123","author":[{"given":"Issmail","family":"Elhallaoui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdelmoutalib","family":"Metrane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,11,14]]},"reference":[{"key":"254_CR1","first-page":"17","volume-title":"Recent Advances in Mathematical Programming","author":"M.L. Balinski","year":"1963","unstructured":"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\u201328. McGraw-Hill, New York (1963)"},{"key":"254_CR2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"Balinski M.L., Quandt R.E.: On an integer program for a delivery problem. Oper. Res. 12, 300\u2013304 (1964)","journal-title":"Oper. Res."},{"key":"254_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"Bland R.G.: New finite pivoting rule for simplex method. Math. Oper. Res. 2, 103\u2013107 (1977)","journal-title":"Math. Oper. Res."},{"key":"254_CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"Charnes A.: Optimality and degeneracy in linear programming. Econometrica 20, 160\u2013170 (1952)","journal-title":"Econometrica"},{"key":"254_CR5","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/S0191-2615(00)00022-9","volume":"35","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau J.-F., Desaulniers G., Lingaya N., Soumis F., Desrosiers J.: Simultaneous locomotive and car assignment at VIA Rail Canada. Transp. Res. B 35, 767\u2013787 (2001)","journal-title":"Transp. Res. B"},{"key":"254_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"G.B. Dantzig","year":"1955","unstructured":"Dantzig G.B., Orden G.B., Wolfe P.: The generalized simplex method for minimizing a linear form under linear inequality restraints. Pac. J. Math. 5, 183\u2013195 (1955)","journal-title":"Pac. J. Math."},{"key":"254_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers M., Desrosiers J., Soumis F.: A new optimization algorithm for the vehicle routing problem with time Windows. Oper. Res. 40, 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"254_CR8","first-page":"191","volume":"26","author":"M. Desrochers","year":"1988","unstructured":"Desrochers M., Soumis F.: A generalized permanent labeling algorithm for the shortest path problem with time Windows. INFOR 26, 191\u2013212 (1988)","journal-title":"INFOR"},{"key":"254_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M. Desrochers","year":"1989","unstructured":"Desrochers M., Soumis F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23, 1\u201313 (1989)","journal-title":"Transp. Sci."},{"key":"254_CR10","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/opre.1050.0222","volume":"53","author":"I. Elhallaoui","year":"2005","unstructured":"Elhallaoui I., Villeneuve D., Soumis F., Desaulniers G.: Dynamic aggregation of set partitioning constraints in column generation. Oper. Res. 53, 632\u2013645 (2005)","journal-title":"Oper. Res."},{"key":"254_CR11","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1137\/S1052623494277470","volume":"8","author":"R. Fletcher","year":"1998","unstructured":"Fletcher R.: A new degeneracy method and steepest-edge-based conditioning for LP. SIAM J. Optim. 8, 1038\u20131059 (1998)","journal-title":"SIAM J. Optim."},{"key":"254_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02096255","volume":"46\/47","author":"T. Gal","year":"1993","unstructured":"Gal, T., (ed.): Degeneracy in optimization problems. Ann. Oper. Res. 46\/47, 1\u20137 (1993)","journal-title":"Ann. Oper. Res."},{"key":"254_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.47.2.247","volume":"47","author":"M. Gamache","year":"1999","unstructured":"Gamache M., Soumis F., Marquis G., Desrosiers J.: A column generation approach for large scale aircrew rostering problems. Oper. Res. 47, 247\u2013263 (1999)","journal-title":"Oper. Res."},{"key":"254_CR14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion A.M.: Lagrangean relaxation for integer programming. Math. Program. Study 2, 82\u2013114 (1974)","journal-title":"Math. Program. Study"},{"key":"254_CR15","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"Glover F.: Surrogate constraints. Oper. Res. 16, 741\u2013749 (1968)","journal-title":"Oper. Res."},{"key":"254_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01593804","volume":"12","author":"D. Goldfarb","year":"1977","unstructured":"Goldfarb D., Reid J.K.: A practicable steepest-edge simplex algorithm. Math. Program. 12, 361\u2013371 (1977)","journal-title":"Math. Program."},{"key":"254_CR17","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/trsc.35.3.286.10153","volume":"35","author":"K. Haase","year":"2001","unstructured":"Haase K., Desaulniers G., Desrosiers J.: Simultaneous vehicle and crew scheduling in urban mass transit systems. Transp. Sci. 35, 286\u2013303 (2001)","journal-title":"Transp. Sci."},{"key":"254_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M. Harris","year":"1973","unstructured":"Harris P.M.: Pivot selection methods of the devex LP code. Math. Program. 5, 1\u201328 (1973)","journal-title":"Math. Program."},{"key":"254_CR19","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K.L. Hoffman","year":"1993","unstructured":"Hoffman K.L., Padberg M.: Solving ariline crew scheduling problems by branch-and-cut. Manage. Sci. 39, 657\u2013682 (1993)","journal-title":"Manage. Sci."},{"key":"254_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column Generation","author":"S. Irnich","year":"2005","unstructured":"Irnich S., Desaulniers G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation., pp. 33\u201365. Springer, New York (2005)"},{"key":"254_CR21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.30.1.62","volume":"30","author":"R. Mendelssohn","year":"1982","unstructured":"Mendelssohn R.: An iterative aggregation procedure for Markov decision process. Oper. Res. 30, 62\u201373 (1982)","journal-title":"Oper. Res."},{"issue":"3","key":"254_CR22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0898-1221(98)00127-8","volume":"36","author":"P.-Q. Pan","year":"1998","unstructured":"Pan P.-Q.: A basis deficiency-allowing variation of the simplex method for linear programming. Comput. Math. Appl. 36(3), 33\u201353 (1998)","journal-title":"Comput. Math. Appl."},{"key":"254_CR23","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"D.F. Rogers","year":"1991","unstructured":"Rogers D.F., Plante R.D., Wong R.T., Evans J.R.: Aggregation and disaggregation techniques and methodology in optimization. Oper. Res. 39, 553\u2013582 (1991)","journal-title":"Oper. Res."},{"key":"254_CR24","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"D.M. Ryan","year":"1988","unstructured":"Ryan D.M., et Osborne M.: On the solution of highly degenerate linear programmes. Math. Program. 41, 385\u2013392 (1988)","journal-title":"Math. Program."},{"key":"254_CR25","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0305-0548(87)90035-9","volume":"14","author":"C.M. Shetty","year":"1987","unstructured":"Shetty C.M., Taylor R.W.: Solving large-scale linear programs by aggregation. Comput. Oper. Res. 14, 385\u2013393 (1987)","journal-title":"Comput. Oper. Res."},{"key":"254_CR26","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T. Terlaky","year":"1993","unstructured":"Terlaky T., Sushong Z.: Pivot rules for linear programming: a survey on recent theoretical developments. Ann. Oper. Res. 46, 203\u2013233 (1993)","journal-title":"Ann. Oper. Res."},{"key":"254_CR27","volume-title":"Logiciel de G\u00e9n\u00e9ration de Colonnes, Ph.D. Dissertation","author":"D. Villeneuve","year":"1999","unstructured":"Villeneuve D.: Logiciel de G\u00e9n\u00e9ration de Colonnes, Ph.D. Dissertation. Universit\u00e9 de Montr\u00e9al, Canada (1999)"},{"key":"254_CR28","first-page":"205","volume":"2","author":"P. Wolfe","year":"1963","unstructured":"Wolfe P.: A technique for resolving degeneracy in LP. SIAM J. 2, 205\u2013211 (1963)","journal-title":"SIAM J."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0254-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0254-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0254-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:06Z","timestamp":1559123406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0254-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,14]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["254"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0254-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,14]]}}}