{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:41:24Z","timestamp":1761896484977},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T00:00:00Z","timestamp":1489363200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10107-017-1123-x","type":"journal-article","created":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T11:16:27Z","timestamp":1489403787000},"page":"327-367","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Integral simplex using decomposition with primal cutting planes"],"prefix":"10.1007","volume":"166","author":[{"given":"Samuel","family":"Rosat","sequence":"first","affiliation":[]},{"given":"Issmail","family":"Elhallaoui","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,13]]},"reference":[{"issue":"1","key":"1123_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/opre.23.1.74","volume":"23","author":"E Balas","year":"1975","unstructured":"Balas, E., Padberg, M.: On the set-covering problem: 2\u2014an algorithm for set partitioning. Oper. Res. 23(1), 74\u201390 (1975)","journal-title":"Oper. Res."},{"key":"1123_CR2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120, 347\u2013380 (2009)","journal-title":"Math. Program."},{"key":"1123_CR3","first-page":"215","volume":"4","author":"A Ben-Israel","year":"1962","unstructured":"Ben-Israel, A., Charnes, A.: On some problems of diophantine programming. Cahiers du Centre d\u2019\u00c9tudes de Recherche Op\u00e9rationnelle 4, 215\u2013280 (1962)","journal-title":"Cahiers du Centre d\u2019\u00c9tudes de Recherche Op\u00e9rationnelle"},{"key":"1123_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","volume":"8","author":"J Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. Handb. Oper. Res. Manag. Sci. 8, 35\u2013139 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"3","key":"1123_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10107-002-0309-y","volume":"95","author":"F Eisenbrand","year":"2003","unstructured":"Eisenbrand, F., Rinaldi, G., Ventura, P.: Primal separation for 0\/1 polytopes. Math. Program. 95(3), 475\u2013491 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"1123_CR6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/ijoc.1100.0425","volume":"23","author":"I Elhallaoui","year":"2011","unstructured":"Elhallaoui, I., Metrane, A., Desaulniers, G., Soumis, F.: An improved primal simplex algorithm for degenerate linear programs. INFORMS J. Comput. 23(4), 569\u2013577 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1123_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-008-0254-5","volume":"123","author":"I Elhallaoui","year":"2010","unstructured":"Elhallaoui, I., Metrane, A., Soumis, F., Desaulniers, G.: Multi-phase dynamic constraint aggregation for set partitioning type problems. Math. Program. 123(2), 345\u2013370 (2010)","journal-title":"Math. Program."},{"issue":"5","key":"1123_CR8","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","volume":"17","author":"RS Garfinkel","year":"1969","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: The set-partitioning problem: set covering with equality constraints. Oper. Res. 17(5), 848\u2013856 (1969)","journal-title":"Oper. Res."},{"key":"1123_CR9","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/opre.16.4.727","volume":"16","author":"F Glover","year":"1968","unstructured":"Glover, F.: A new foundation for a simplified primal integer programming algorithm. Oper. Res. 16, 727\u2013740 (1968)","journal-title":"Oper. Res."},{"issue":"5","key":"1123_CR10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear program. Bull. Am. Math. Soc. 64(5), 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"1123_CR11","unstructured":"Gomory, R.E.: All-integer integer programming algorithm. Industrial Scheduling, pp. 193\u2013206 (1963)"},{"issue":"2","key":"1123_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10107-003-0384-8","volume":"96","author":"UU Haus","year":"2003","unstructured":"Haus, U.U., K\u00f6ppe, M., Weismantel, R.: A primal all-integer algorithm based on irreducible solutions. Math. Program. 96(2), 205\u2013246 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1123_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01588963","volume":"14","author":"MJ Kallio","year":"1978","unstructured":"Kallio, M.J., Porteus, E.L.: A class of methods for linear programming. Math. Program. 14(1), 161\u2013169 (1978)","journal-title":"Math. Program."},{"issue":"1","key":"1123_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s001860200200","volume":"56","author":"AN Letchford","year":"2002","unstructured":"Letchford, A.N., Lodi, A.: Primal cutting plane algorithms revisited. Math. Methods Oper. Res. 56(1), 67\u201381 (2002)","journal-title":"Math. Methods Oper. Res."},{"key":"1123_CR15","doi-asserted-by":"crossref","unstructured":"Letchford, A.N., Lodi, A.: An augment-and-branch-and-cut framework for mixed 0\u20131 programming. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink!. Lecture Notes in Computer Science, vol. 2570, pp. 119\u2013133. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36478-1_12"},{"issue":"3","key":"1123_CR16","first-page":"209","volume":"1","author":"AN Letchford","year":"2003","unstructured":"Letchford, A.N., Lodi, A.: Primal separation algorithms. Q. J. Belg Fr. Ital. Oper. Res. Soc. 1(3), 209\u2013224 (2003)","journal-title":"Q. J. Belg Fr. Ital. Oper. Res. Soc."},{"issue":"1","key":"1123_CR17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ejor.2010.05.002","volume":"207","author":"A Metrane","year":"2010","unstructured":"Metrane, A., Soumis, F., Elhallaoui, I.: Column generation decomposition with the degenerate constraints in the subproblem. Eur. J. Oper. Res. 207(1), 37\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1123_CR18","unstructured":"Omer, J., Rosat, S., Raymond, V., Soumis, F.: Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis. Les Cahiers du GERAD G-2014-13, HEC Montr\u00e9al, Canada. Submitted to Informs Journal on Computing (2014)"},{"issue":"4","key":"1123_CR19","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A new algorithm for the maximum-weight clique problem. Nord. J. Comput. 8(4), 424\u2013436 (2001)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"1123_CR20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5(1), 199\u2013215 (1973)","journal-title":"Math. Program."},{"issue":"1","key":"1123_CR21","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.ejor.2007.09.037","volume":"192","author":"E R\u00f6nnberg","year":"2009","unstructured":"R\u00f6nnberg, E., Larsson, T.: Column generation in the integral simplex method. Eur. J. Oper. Res. 192(1), 333\u2013342 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1123_CR22","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.ejor.2013.08.036","volume":"233","author":"E R\u00f6nnberg","year":"2014","unstructured":"R\u00f6nnberg, E., Larsson, T.: All-integer column generation for set partitioning: basic principles and extensions. Eur. J. Oper. Res. 233(3), 529\u2013538 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1123_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2015.12.015","volume":"217, Part 1","author":"S Rosat","year":"2017","unstructured":"Rosat, S., Elhallaoui, I., Soumis, F., Chakour, D.: Influence of the normalization constraint on the integral simplex using decomposition. Discret. Appl. Math. 217, Part 1, 53\u201370 (2017)","journal-title":"Discret. Appl. Math."},{"key":"1123_CR24","doi-asserted-by":"crossref","unstructured":"Rosat, S., Elhallaoui, I., Soumis, F., Lodi, A.: Integral simplex using decomposition with primal cuts. In: Gudmundsson, J., Katajainen, J. (eds.) Experimental Algorithms, Lecture Notes in Computer Science, vol. 8504, pp. 22\u201333. Springer, New York (2014)","DOI":"10.1007\/978-3-319-07959-2_3"},{"issue":"6","key":"1123_CR25","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s10951-012-0286-9","volume":"16","author":"A Rozenknop","year":"2013","unstructured":"Rozenknop, A., Wolfler Calvo, R., Alfandari, L., Chemla, D., L\u00e9tocart, L.: Solving the electricity production planning problem by a column generation based heuristic. J. Sched. 16(6), 585\u2013604 (2013)","journal-title":"J. Sched."},{"issue":"2","key":"1123_CR26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/321752.321753","volume":"20","author":"HM Salkin","year":"1973","unstructured":"Salkin, H.M., Koncal, R.D.: Set covering by an all-integer algorithm: computational experience. J. ACM 20(2), 189\u2013193 (1973)","journal-title":"J. ACM"},{"key":"1123_CR27","unstructured":"Saxena, A.: Set-partitioning via integral simplex method. Unpublished manuscript, OR Group, Carnegie-Mellon University, Pittsburgh (2003)"},{"key":"1123_CR28","doi-asserted-by":"crossref","unstructured":"Schulz, A.S., Weismantel, R., Ziegler, G.M.: 0\/1-integer programming: Optimization and augmentation are equivalent. In: Spirakis, P. (ed.) ESA \u201995, LNCS, vol. 979, pp. 473\u2013483. Springer, Berlin (1995)","DOI":"10.1007\/3-540-60313-1_164"},{"key":"1123_CR29","first-page":"245","volume-title":"Discrete Optimization, Handbooks in Operations Research and Management Science","author":"B Spille","year":"2005","unstructured":"Spille, B., Weismantel, R.: Primal integer programming. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol. 12, pp. 245\u2013276. Elsevier, Amsterdam (2005)"},{"key":"1123_CR30","doi-asserted-by":"crossref","unstructured":"Stallmann, M.F., Brglez, F.: High-contrast algorithm behavior: observation, hypothesis, and experimental design. In: Proceedings of the 2007 Workshop on Experimental Computer Science, ExpCS \u201907. ACM, New York, NY, USA (2007)","DOI":"10.1145\/1281700.1281712"},{"issue":"3","key":"1123_CR31","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/trsc.32.3.232","volume":"32","author":"M Stojkovi\u0107","year":"1998","unstructured":"Stojkovi\u0107, M., Soumis, F., Desrosiers, J.: The operational airline crew scheduling problem. Transp. Sci. 32(3), 232\u2013245 (1998)","journal-title":"Transp. Sci."},{"issue":"3","key":"1123_CR32","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1019758821507","volume":"22","author":"GL Thompson","year":"2002","unstructured":"Thompson, G.L.: An integral simplex algorithm for solving combinatorial optimization problems. Comput. Optim. Appl. 22(3), 351\u2013367 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1123_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cor.2014.03.020","volume":"49","author":"M Towhidi","year":"2014","unstructured":"Towhidi, M., Desrosiers, J., Soumis, F.: The positive edge criterion within COIN-OR\u2019s CLP. Comput. Oper. Res. 49, 41\u201346 (2014)","journal-title":"Comput. Oper. Res."},{"key":"1123_CR34","first-page":"1544","volume":"10","author":"V Trubin","year":"1969","unstructured":"Trubin, V.: On a method of solution of integer linear programming problems of a special kind. Sov. Math. Dokl. 10, 1544\u20131546 (1969)","journal-title":"Sov. Math. Dokl."},{"key":"1123_CR35","doi-asserted-by":"crossref","unstructured":"Young, R.D.: A primal (all-integer) integer programming algorithm. J. Res. Natl. Bur. Stand. B Math. Math. Phys. 69B, 213\u2013250 (1965)","DOI":"10.6028\/jres.069B.025"},{"issue":"4","key":"1123_CR36","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.16.4.750","volume":"16","author":"RD Young","year":"1968","unstructured":"Young, R.D.: A simplified primal (all-integer) integer programming algorithm. Oper. Res. 16(4), 750\u2013782 (1968)","journal-title":"Oper. Res."},{"issue":"2","key":"1123_CR37","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1287\/opre.2013.1247","volume":"62","author":"A Zaghrouti","year":"2014","unstructured":"Zaghrouti, A., Soumis, F., El Hallaoui, I.: Integral simplex using decomposition for the set partitioning problem. Oper. Res. 62(2), 435\u2013449 (2014)","journal-title":"Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1123-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1123-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1123-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T17:18:35Z","timestamp":1568913515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1123-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,13]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1123-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,13]]}}}