{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:46:47Z","timestamp":1761896807302,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10479-018-2868-1","type":"journal-article","created":{"date-parts":[[2018,5,2]],"date-time":"2018-05-02T22:40:14Z","timestamp":1525300814000},"page":"645-671","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improving set partitioning problem solutions by zooming around an improving direction"],"prefix":"10.1007","volume":"284","author":[{"given":"Abdelouahab","family":"Zaghrouti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Issmail","family":"El Hallaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"key":"2868_CR1","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","volume":"20","author":"E Balas","year":"1972","unstructured":"Balas, E., & Padberg, M. W. (1972). On the set-covering problem. Operations Research, 20, 1152\u20131161.","journal-title":"Operations Research"},{"key":"2868_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/opre.23.1.74","volume":"23","author":"E Balas","year":"1975","unstructured":"Balas, E., & Padberg, M. W. (1975). On the set-covering problem: II. An algorithm for set partitioning. Operations Research, 23, 74\u201390.","journal-title":"Operations Research"},{"key":"2868_CR3","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E Balas","year":"1976","unstructured":"Balas, E., & Padberg, M. W. (1976). Set partitioning: A survey. SIAM Review, 18, 710\u2013760.","journal-title":"SIAM Review"},{"key":"2868_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"ML Balinski","year":"1964","unstructured":"Balinski, M. L., & Quandt, R. E. (1964). On an integer program for a delivery problem. Operations Research, 12, 300\u2013304.","journal-title":"Operations Research"},{"key":"2868_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"2868_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.04.049","author":"H Bouarab","year":"2017","unstructured":"Bouarab, H., El Hallaoui, I., Metrane, A., & Soumis, F. (2017). Dynamic constraint and variable aggregation in column generation. European Journal of Operational Research,. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2017.04.049\n\n.","journal-title":"European Journal of Operational Research"},{"key":"2868_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02025297","volume":"43","author":"N Christofides","year":"1993","unstructured":"Christofides, N., & Paixao, J. (1993). Algorithms for large scale set covering problems. Annals of Operations Research, 43, 259. \nhttps:\/\/doi.org\/10.1007\/BF02025297\n\n.","journal-title":"Annals of Operations Research"},{"key":"2868_CR8","doi-asserted-by":"publisher","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. (2001). Simultaneous locomotive and car assignment at VIA Rail Canada. Transportation Research B, 35, 767\u2013787.","journal-title":"Transportation Research B"},{"key":"2868_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230110206","volume":"11","author":"F Cullen","year":"1981","unstructured":"Cullen, F., Jarvis, J., & Ratliff, H. (1981). Set partitioning based heuristics for interactive routing. Networks, 11, 125\u2013143.","journal-title":"Networks"},{"key":"2868_CR10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Soumis, F. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40, 342\u2013354.","journal-title":"Operations Research"},{"key":"2868_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers, M., & Soumis, F. (1989). A column generation approach to the urban transit crew scheduling problem. Transportation Science, 23, 1\u201313.","journal-title":"Transportation Science"},{"issue":"4","key":"2868_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/ijoc.1100.0425","volume":"23","author":"I Hallaoui El","year":"2011","unstructured":"El Hallaoui, I., Metrane, A., Desaulniers, G., & Soumis, F. (2011). An improved primal simplex algorithm for degenerate linear programs. INFORMS Journal on Computing, 23(4), 569\u2013577.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2868_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10107-008-0254-5","volume":"123","author":"I Hallaoui El","year":"2010","unstructured":"El Hallaoui, I., Metrane, A., Soumis, F., & Desaulniers, G. (2010). Multi-phase dynamic constraint aggregation for set partitioning type problems. Mathematical Programming A, 123(2), 345\u2013370.","journal-title":"Mathematical Programming A"},{"key":"2868_CR14","doi-asserted-by":"publisher","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. (1999). A column generation approach for large scale aircrew rostering problems. Operations Research, 47, 247\u2013263.","journal-title":"Operations Research"},{"issue":"5","key":"2868_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64(5), 275\u2013278.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"2868_CR16","unstructured":"Gomory, R. E. (1963). An all-integer integer programming algorithm. In F. M. John., & L. T. Gerald (Eds.), Industrial scheduling (pp. 193\u2013206). Englewood Cliffs, NJ: Prentice Hall."},{"key":"2868_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10479-005-3975-3","volume":"140","author":"B Gopalakrishnan","year":"2005","unstructured":"Gopalakrishnan, B., & Johnson, E. L. (2005). Airline crew scheduling: State-of-the-art. Annals of Operations Research, 140, 305. \nhttps:\/\/doi.org\/10.1007\/s10479-005-3975-3\n\n.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2868_CR18","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/trsc.35.3.286.10153","volume":"35","author":"K Haase","year":"2003","unstructured":"Haase, K., Desaulniers, G., & Desrosiers, J. (2003). Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Science, 35(3), 286\u2013303.","journal-title":"Transportation Science"},{"issue":"3","key":"2868_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s001860100124","volume":"53","author":"U Haus","year":"2001","unstructured":"Haus, U., K\u00f6ppe, M., & Weismantel, R. (2001). The integral basis method for integer programming. Mathematical Methods of Operations Research, 53(3), 353\u2013361.","journal-title":"Mathematical Methods of Operations Research"},{"key":"2868_CR20","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"KL Hoffman","year":"1993","unstructured":"Hoffman, K. L., & Padberg, M. (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science, 39, 657\u2013682.","journal-title":"Management Science"},{"key":"2868_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1018953006796","volume":"81","author":"A Iqbal Ali","year":"1998","unstructured":"Iqbal Ali, A. (1998). Reformulation of the set partitioning problem as a pure network with special order set constraints. Annals of Operations Research, 81, 233. \nhttps:\/\/doi.org\/10.1023\/A:1018953006796\n\n.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2868_CR22","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/s001860200200","volume":"56","author":"AN Letchford","year":"2002","unstructured":"Letchford, A. N., & Lodi, A. (2002). Primal cutting plane algorithms revisited. Mathematical Methods of Operations Research, 56(1), 670\u201381.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"6","key":"2868_CR23","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME Lubbecke","year":"2005","unstructured":"Lubbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"key":"2868_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.ejor.2007.09.037","volume":"192","author":"E R\u00f6nnberg","year":"2009","unstructured":"R\u00f6nnberg, E., & Torbj\u00f6rn, L. (2009). Column generation in the integral simplex method. European Journal of Operational Research, 192, 333\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"2868_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.12.015","author":"S Rosat","year":"2014","unstructured":"Rosat, S., El Halaoui, I., & Soumis, F. (2014a). Influence of the normalization constraint on the integral simplex using decomposition. Discrete Applied Maths,. \nhttps:\/\/doi.org\/10.1016\/j.dam.2015.12.015\n\n.","journal-title":"Discrete Applied Maths"},{"key":"2868_CR26","doi-asserted-by":"crossref","unstructured":"Rosat, S., El Halaoui, I., Soumis, F., & Lodi, A. (2014b). Integral simplex using decomposition with primal cuts. Lecture Notes in Computer Science (Springer), SEA 2014 (Symposium on Experimental Algorithms) Proceedings.","DOI":"10.1007\/978-3-319-07959-2_3"},{"key":"2868_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1123-x","author":"S Rosat","year":"2017","unstructured":"Rosat, S., El Halaoui, I., Soumis, F., & Lodi, A. (2017). Integral simplex using decomposition with primal cuts. Mathematical Programming,. \nhttps:\/\/doi.org\/10.1007\/s10107-017-1123-x\n\n.","journal-title":"Mathematical Programming"},{"key":"2868_CR28","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1019758821507","volume":"22","author":"GL Thompson","year":"2002","unstructured":"Thompson, G. L. (2002). An integral simplex algorithm for solving combinatorial optimization problems. Computational Optimization and Applications, 22, 351\u2013367.","journal-title":"Computational Optimization and Applications"},{"key":"2868_CR29","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1287\/opre.2013.1247","volume":"62","author":"A Zaghrouti","year":"2014","unstructured":"Zaghrouti, A., Soumis, F., & El Hallaoui, I. (2014). Integral simplex using decomposition for the set partitioning problem. Operations Research, 62, 435\u2013449. \nhttps:\/\/doi.org\/10.1287\/opre.2013.1247\n\n.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2868-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2868-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2868-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T07:54:26Z","timestamp":1577951666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2868-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,3]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2868"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2868-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,5,3]]},"assertion":[{"value":"3 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}