{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:31:37Z","timestamp":1761895897206},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_3","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"22-33","source":"Crossref","is-referenced-by-count":6,"title":["Integral Simplex Using Decomposition with Primal Cuts"],"prefix":"10.1007","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","reference":[{"issue":"1","key":"3_CR1","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.: On the set-covering problem: 2 - an algorithm for set partitioning. Oper. Res.\u00a023(1), 74\u201390 (1975)","journal-title":"Oper. Res."},{"key":"3_CR2","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\u00c9t. de Rech. Op\u00e9r.\u00a04, 215\u2013280 (1962)","journal-title":"Cahiers du Centre d\u2019\u00c9t. de Rech. Op\u00e9r."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","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.\u00a095(3), 475\u2013491 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","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.\u00a023(4), 569\u2013577 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","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.\u00a053(4), 632\u2013645 (2005)","journal-title":"Oper. Res."},{"key":"3_CR6","doi-asserted-by":"publisher","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.\u00a016, 727\u2013740 (1968)","journal-title":"Oper. Res."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A.V. Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM\u00a036(4), 873\u2013886 (1989)","journal-title":"J. ACM"},{"issue":"5","key":"3_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear program. Bull. Amer. Math. Soc.\u00a064(5), 275\u2013278 (1958)","journal-title":"Bull. Amer. Math. Soc."},{"unstructured":"Gomory, R.E.: All-integer integer programming algorithm. Ind. Sched., 193\u2013206 (1963)","key":"3_CR9"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s001860200200","volume":"56","author":"A.N. Letchford","year":"2002","unstructured":"Letchford, A.N., Lodi, A.: Primal cutting plane algorithms revisited. Math. Methods Oper. Res.\u00a056(1), 67\u201381 (2002)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"3_CR11","first-page":"209","volume":"1","author":"A.N. Letchford","year":"2003","unstructured":"Letchford, A.N., Lodi, A.: Primal separation algorithms. Q. J. Belg. Fr. Ital. Oper. Res. Soc.\u00a01(3), 209\u2013224 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"issue":"1","key":"3_CR12","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., Larsson, T.: Column generation in the integral simplex method. European J. Oper. Res.\u00a0192(1), 333\u2013342 (2009)","journal-title":"European J. Oper. Res."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/321752.321753","volume":"20","author":"H.M. Salkin","year":"1973","unstructured":"Salkin, H.M., Koncal, R.D.: Set covering by an all-integer algorithm: Computational experience. J. ACM\u00a020(2), 189\u2013193 (1973)","journal-title":"J. ACM"},{"unstructured":"Saxena, A.: Set-partitioning via integral simplex method. OR Group, Carnegie-Mellon University, Pittsburgh (2003) (unpublished manuscript)","key":"3_CR14"},{"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 1995. LNCS, vol.\u00a0979, pp. 473\u2013483. Springer, Heidelberg (1995)","key":"3_CR15","DOI":"10.1007\/3-540-60313-1_164"},{"key":"3_CR16","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.\u00a012, pp. 245\u2013276. Elsevier, Amsterdam (2005)"},{"unstructured":"Stallmann, M.F., Brglez, F.: High-contrast algorithm behavior: Observation, conjecture, and experimental design. In: ACM-FCRC. ACM, New York (2007), 549075","key":"3_CR17"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1019758821507","volume":"22","author":"G.L. Thompson","year":"2002","unstructured":"Thompson, G.L.: An integral simplex algorithm for solving combinatorial optimization problems. Comput. Optim. Appl.\u00a022(3), 351\u2013367 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"3_CR19","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. Soviet Math. Dokl.\u00a010, 1544\u20131546 (1969)","journal-title":"Soviet Math. Dokl."},{"doi-asserted-by":"crossref","unstructured":"Young, R.D.: A primal (all-integer) integer programming algorithm. J. Res. Nat. Bureau of Standards: B. Math. and Math. Phys., 213\u2013250 (1965)","key":"3_CR20","DOI":"10.6028\/jres.069B.025"},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1287\/opre.16.4.750","volume":"16","author":"R.D. Young","year":"1968","unstructured":"Young, R.D.: A simplified primal (all-integer) integer programming algorithm. Oper. Res.\u00a016(4), 750\u2013782 (1968)","journal-title":"Oper. Res."},{"unstructured":"Zaghrouti, A., Soumis, F., Elhallaoui, I.: Integral simplex using decomposition for the set partitioning problem. Oper. Res. (to appear)","key":"3_CR22"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:30:19Z","timestamp":1558906219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}