{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T10:50:38Z","timestamp":1696157438750},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,7]],"date-time":"2016-05-07T00:00:00Z","timestamp":1462579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s12532-016-0106-x","type":"journal-article","created":{"date-parts":[[2016,5,7]],"date-time":"2016-05-07T10:55:06Z","timestamp":1462618506000},"page":"39-59","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast separation for the three-index assignment problem"],"prefix":"10.1007","volume":"9","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","published-online":{"date-parts":[[2016,5,7]]},"reference":[{"key":"106_CR1","doi-asserted-by":"crossref","first-page":"3007","DOI":"10.1016\/j.cor.2004.04.010","volume":"32","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes, R., Parreo, F., Tamarit, J.: A branch-and-cut algorithm for the pallet loading problem. Comput. Oper. Res. 32, 3007\u20133029 (2005)","journal-title":"Comput. Oper. Res."},{"key":"106_CR2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.laa.2005.11.009","volume":"416","author":"G Appa","year":"2006","unstructured":"Appa, G., Magos, D., Mourtos, I.: On multi-index assignment polytopes. Linear Algebra Appl. 416, 224\u2013241 (2006)","journal-title":"Linear Algebra Appl."},{"key":"106_CR3","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006). (ISBN 978-0-691-12993-8)"},{"key":"106_CR4","doi-asserted-by":"crossref","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 Appl. Math. 43, 1\u201312 (1993)","journal-title":"Discrete Appl. Math."},{"key":"106_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","volume":"23","author":"E Balas","year":"1989","unstructured":"Balas, E., Saltzman, M.: Facets of the three-index assignment polytope. Discrete Appl. Math. 23, 201\u2013229 (1989)","journal-title":"Discrete Appl. Math."},{"key":"106_CR6","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E Balas","year":"1991","unstructured":"Balas, E., Saltzman, M.: An algorithm for the three index assignment problem. Oper. Res. 39, 150\u2013161 (1991)","journal-title":"Oper. Res."},{"key":"106_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0166-218X(95)00031-L","volume":"65","author":"R Burkard","year":"1996","unstructured":"Burkard, R., Rudolf, R., Woeginger, G.: Three-dimensional axial assignment problems with decomposable cost coefficients. Discrete Appl. Math. 65, 123\u2013139 (1996)","journal-title":"Discrete Appl. Math."},{"key":"106_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0166-218X(99)00050-5","volume":"92","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Salazar, J.: Separating lifted odd-hole inequalities to solve the index selection problem. Discrete Appl. Math. 92, 111\u2013134 (1999)","journal-title":"Discrete Appl. Math."},{"key":"106_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, E., Cunningham, W.: Separation problems for the stable set polytope. In: Proceedings of The 4th Integer Programming and Combinatorial Optimization Conference Proceedings (1995)","DOI":"10.1007\/3-540-59408-6_42"},{"key":"106_CR10","first-page":"389","volume":"77","author":"E Cheng","year":"1997","unstructured":"Cheng, E., Cunningham, W.: Wheel inequalities for stable set polytopes. Math. Program. 77, 389\u2013421 (1997)","journal-title":"Math. Program."},{"key":"106_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y Crama","year":"1992","unstructured":"Crama, Y., Spieksma, F.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60, 273\u2013279 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"106_CR12","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107990047a","volume":"85","author":"J Akker Van den","year":"1999","unstructured":"Van den Akker, J., van Hoesel, C., Savelsbergh, M.: A polyhedral approach to single machine scheduling problems. Math. Program. 85, 541\u2013572 (1999)","journal-title":"Math. Program."},{"key":"106_CR13","doi-asserted-by":"crossref","unstructured":"Dokka, T.: Algorithms for multi-index assignment problems. PhD thesis, KU Leuven (2013)","DOI":"10.1007\/978-3-642-32147-4_18"},{"issue":"2","key":"106_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10589-005-4558-6","volume":"30","author":"D Grundel","year":"2005","unstructured":"Grundel, D., Pardalos, P.: Test problem generator for the multidimensional assignment problem. Comput. Optim. Appl. 30(2), 133\u2013146 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"106_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/11730095_6","volume":"3906","author":"B H\u00f6fler","year":"2006","unstructured":"H\u00f6fler, B., F\u00fcgenschuh, A.: Parametrized grasp heuristics for three-index assignment. EvoCOP Lect. Notes Comput. Sci. 3906, 61\u201372 (2006)","journal-title":"EvoCOP Lect. Notes Comput. Sci."},{"key":"106_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.: Separation algorithms for 0\u20131 knapsack polytopes. Math. Program. 124, 69\u201391 (2010)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"106_CR17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(00)00194-3","volume":"104","author":"J Kececioglu","year":"2000","unstructured":"Kececioglu, J., Lenhof, Hans-Peter, Mehlhorn, K., Mutzel, P., Reinert, K., Vingron, M.: A polyhedral approach to sequence alignment problems. Discrete Appl. Math. 104(1\u20133), 143\u2013186 (2000)","journal-title":"Discrete Appl. Math."},{"key":"106_CR18","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.dss.2008.10.009","volume":"46","author":"M Landete","year":"2009","unstructured":"Landete, M., Escudero, L., Mar\u00ecn, A.: A branch-and-cut algorithm for the winner determination problem. Decis. Support Syst. 46, 649\u2013659 (2009)","journal-title":"Decis. Support Syst."},{"key":"106_CR19","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.disopt.2009.05.001","volume":"6","author":"D Magos","year":"2009","unstructured":"Magos, D., Mourtos, I.: Clique facets of the axial and planar assignment polytopes. Discrete Optim. 6, 394\u2013413 (2009)","journal-title":"Discrete Optim."},{"key":"106_CR20","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"5","author":"GL Nemhauser","year":"1992","unstructured":"Nemhauser, G.L., Sigismondi, G.: A strong cutting plane\/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. 5, 443\u2013457 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"106_CR21","doi-asserted-by":"crossref","unstructured":"Qi, L., Sun, D.: Polyhedral methods for solving three index assignment problems. In: Pardalos, P.M., Pitsoulis, L. S., (eds.) Nonlinear Assignment Problems: Algorithms and Applications, pp. 91\u2013107. Springer, US (2000)","DOI":"10.1007\/978-1-4757-3155-2_5"},{"issue":"4","key":"106_CR22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s10878-009-9264-3","volume":"21","author":"S Rebennack","year":"2011","unstructured":"Rebennack, S., Oswald, M., Oliver Theis, D., Seitz, H., Reinelt, G., Pardalos, P.: A branch and cut solver for the maximum stable set problem. J. Comb. Optim. 21(4), 434\u2013457 (2011)","journal-title":"J. Comb. Optim."},{"key":"106_CR23","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"106_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3155-2_1","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","author":"F Spieksma","year":"2000","unstructured":"Spieksma, F.: Multi-index assignment problems: complexity, approximation, applications. In: Pardalos, P.M., Pitsoulis, L. (eds.) Nonlinear Assignment Problems: Algorithms and Applications, pp. 1\u201312. Kluwer Academic Publisher, Nowell (2000)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0106-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-016-0106-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0106-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0106-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T07:46:44Z","timestamp":1567842404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-016-0106-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,7]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s12532-016-0106-x","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,7]]}}}