{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:47Z","timestamp":1725586847409},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_33","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"417-429","source":"Crossref","is-referenced-by-count":1,"title":["Fixed-Charge Transportation on a Path: Linear Programming Formulations"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Van Vyve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Akartunal, K., Miller, A.J.: A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems (2007), Optimization Online, \n                  \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2007\/05\/1668.pdf"},{"key":"33_CR2","first-page":"149","volume":"81","author":"K. Aardal","year":"1998","unstructured":"Aardal, K.: Capacitated Facility Location: Separation Algorithms and Computational Experience. Mathematical Programming A\u00a081, 149\u2013175 (1998)","journal-title":"Mathematical Programming A"},{"key":"33_CR3","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Inc., Englewood Cliffs (1993)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1287\/moor.1080.0354","volume":"34","author":"M. Conforti","year":"2009","unstructured":"Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.A.: Network formulations of mixed-integer programs. Mathematics of Operations Research\u00a034, 194\u2013209 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"33_CR5","unstructured":"Carr, R., Fleischer, L., Leung, V., Phillips, C.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 106\u2013115 (2000)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/moor.1100.0454","volume":"35","author":"M. Conforti","year":"2010","unstructured":"Conforti, M., Wolsey, L.A., Zambelli, G.: Projecting an extended formulation for mixed-integer covers on bipartite graphs. Mathematics of Operations Research\u00a035, 603\u2013623 (2010)","journal-title":"Mathematics of Operations Research"},{"key":"33_CR7","unstructured":"Di Summa, M., Wolsey, L.A.: Mixing sets linked by bidirected paths. CORE Discussion Paper 2010\/61, Louvain-la-Neuve (2010)"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming A\u00a085, 439\u2013467 (1999)","journal-title":"Mathematical Programming A"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.orl.2003.06.001","volume":"32","author":"R. Jans","year":"2004","unstructured":"Jans, R., Degraeve, Z.: Improved lower bounds for the capacitated lot sizing problem with setup times. Operations Research Letters\u00a032, 185\u2013195 (2004)","journal-title":"Operations Research Letters"},{"key":"33_CR10","first-page":"155","volume-title":"Optimierung bei Graphentheoretischen und Ganzzahligen Probleme","author":"J. Krarup","year":"1977","unstructured":"Krarup, J., Bilde, O.: Plant location, set covering and economic lotsizes: an O(mn) algorithm for structured problems. In: Collatz, L. (ed.) Optimierung bei Graphentheoretischen und Ganzzahligen Probleme, pp. 155\u2013180. Birkhauser Verlag, Basel (1977)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"Padberg, M.W., van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Operations Research\u00a033, 842\u2013861 (1985)","journal-title":"Operations Research"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"33","author":"T.J. Roy van","year":"1987","unstructured":"van Roy, T.J., Wolsey, L.A.: Solving mixed integer programming problems using automatic reformulation. Operations Research\u00a033, 45\u201357 (1987)","journal-title":"Operations Research"},{"key":"33_CR13","unstructured":"Van Vyve, M.: Fixed-charge transportation on a path: optimization, LP formulations and separation. CORE Discussion Paper 2010\/68, Louvain-la-Neuve (2010)"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-005-0663-7","volume":"105","author":"M. Vyve Van","year":"2006","unstructured":"Van Vyve, M., Wolsey, L.A.: Approximate extended formulations. Mathematical Programming B\u00a0105, 501\u2013522 (2006)","journal-title":"Mathematical Programming B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T02:09:20Z","timestamp":1553825360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}