{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:33:29Z","timestamp":1732037609976},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RDCPJ 477127-14"],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s13675-018-0098-6","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T09:29:15Z","timestamp":1526635755000},"page":"185-206","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved integral simplex using decomposition for the set partitioning problem"],"prefix":"10.1016","volume":"6","author":[{"given":"Abdelouahab","family":"Zaghrouti","sequence":"first","affiliation":[]},{"given":"Issmail","family":"El Hallaoui","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-018-0098-6_CR1","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","article-title":"On the set-covering problem","volume":"20","author":"Balas","year":"1972","journal-title":"Oper Res"},{"key":"10.1007\/s13675-018-0098-6_CR2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/opre.23.1.74","article-title":"On the set-covering problem: II. An algorithm for set partitioning","volume":"23","author":"Balas","year":"1975","journal-title":"Oper Res"},{"issue":"4","key":"10.1007\/s13675-018-0098-6_CR3","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/ijoc.1100.0425","article-title":"An improved primal simplex algorithm for degenerate linear programs","volume":"23","author":"El Hallaoui","year":"2011","journal-title":"INFORMS J Comput"},{"issue":"3","key":"10.1007\/s13675-018-0098-6_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s001860100124","article-title":"The integral basis method for integer programming","volume":"53","author":"Haus","year":"2001","journal-title":"Math Methods Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0098-6_CR5","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.ejor.2007.09.037","article-title":"Column generation in the integral simplex method","volume":"192","author":"R\u00f6nnberg","year":"2009","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-018-0098-6_CR6","doi-asserted-by":"crossref","unstructured":"Rosat S, El Hallaoui I, Soumis F, Lodi A (2014) Integral simplex using decomposition with primal cuts. In: Experimental algorithms. Springer International Publishing, pp 22\u201333","DOI":"10.1007\/978-3-319-07959-2_3"},{"key":"10.1007\/s13675-018-0098-6_CR7","doi-asserted-by":"crossref","unstructured":"Rosat S, El Halaoui I, Soumis F, Chakour D (2017) Influence of the normalization constraint on the integral simplex using decomposition. Discrete Appl Math 217(1):53\u201370","DOI":"10.1016\/j.dam.2015.12.015"},{"key":"10.1007\/s13675-018-0098-6_CR8","unstructured":"Saxena A (2003) Set-partitioning via integral simplex method. Doctoral dissertation, Ph. D. thesis, Carnegie Mellon University, Pittsburgh"},{"key":"10.1007\/s13675-018-0098-6_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1019758821507","article-title":"An integral simplex algorithm for solving combinatorial optimization problems","volume":"22","author":"Thompson","year":"2002","journal-title":"Comput Optim Appl"},{"key":"10.1007\/s13675-018-0098-6_CR10","unstructured":"Zaghrouti A, El Hallaoui I, Soumis F (2013) Improving ILP solutions by zooming around an improving direction. Les Cahiers du GERAD G-2013-107"},{"issue":"2","key":"10.1007\/s13675-018-0098-6_CR11","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1287\/opre.2013.1247","article-title":"Integral simplex using decomposition for the set partitioning problem","volume":"62","author":"Zaghrouti","year":"2014","journal-title":"Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0098-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0098-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100099X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100099X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0098-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:25:14Z","timestamp":1648632314000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S219244062100099X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["S219244062100099X"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0098-6","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"13 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}