{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:54:18Z","timestamp":1725458058255},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_18","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"189-200","source":"Crossref","is-referenced-by-count":1,"title":["Fast Separation Algorithms for Three-Index Assignment Problems"],"prefix":"10.1007","author":[{"given":"Trivikram","family":"Dokka","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Mourtos","sequence":"additional","affiliation":[]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2006) ISBN 978-0-691-12993-8"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(93)90164-J","volume":"43","author":"E. Balas","year":"1993","unstructured":"Balas, E., Qi, L.: Linear time separation algorithms for the three index assignment polytope. Discrete Applied Mathematics\u00a043, 1\u201312 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","volume":"23","author":"E. Balas","year":"1989","unstructured":"Balas, E., Saltzman, M.J.: Facets of the three-index assignment polytope. Discrete Applied Mathematics\u00a023, 201\u2013229 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Letchford, A.N.: On the separation of split cuts and related inequalities. Mathematical Programming\u00a094, 279\u2013294 (2003)","journal-title":"Mathematical Programming"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y. Crama","year":"1992","unstructured":"Crama, Y., Spieksma, F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. European Journal of Operational Research\u00a060, 273\u2013279 (1992)","journal-title":"European Journal of Operational Research"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1287\/moor.1060.0214","volume":"31","author":"L.K. Fleischer","year":"2006","unstructured":"Fleischer, L.K., Letchford, A.N., Lodi, A.: Polynomial-time separation of a superclass of simple comb inequalities. Mathematics of Operations Research\u00a031, 696\u2013713 (2006)","journal-title":"Mathematics of Operations Research"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K. Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.N.: Separation algorithms for 0-1 knapsack polytopes. Mathematical Programming\u00a0124, 69\u201391 (2010)","journal-title":"Mathematical Programming"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley (1988)","DOI":"10.1002\/9781118627372"},{"key":"18_CR9","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","author":"L. Qi","year":"2000","unstructured":"Qi, L., Sun, D.: Polyhedral methods for solving three index assignment problems. In: Pardalos, P.M., Pitsoulis, L. (eds.) Nonlinear Assignment Problems: Algorithms and Applications, Kluwer Academic Publisher, Nowell (2000)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s101070050071","volume":"85","author":"J.M. Akker Van den","year":"1999","unstructured":"Van den Akker, J.M., Van Hoesel, C.P.M., Savelsbergh, M.W.P.: A polyhedral approach to single machine scheduling problems. Mathematical Programming\u00a085, 541\u2013572 (1999)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:01Z","timestamp":1620129361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}