{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:54:10Z","timestamp":1725458050891},"publisher-location":"Berlin, Heidelberg","reference-count":8,"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_2","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"15-18","source":"Crossref","is-referenced-by-count":0,"title":["Branch-and-Price Guided Search"],"prefix":"10.1007","author":[{"given":"Mike","family":"Hewitt","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/trsc.1070.0204","volume":"42","author":"C. Archetti","year":"2008","unstructured":"Archetti, C., Speranza, M.G., Savelsbergh, M.W.P.: An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science\u00a042, 22\u201331 (2008)","journal-title":"Transportation Science"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming\u00a0102, 71\u201390 (2005)","journal-title":"Mathematical Programming"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R. Franceschi De","year":"2006","unstructured":"De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming B\u00a0105, 471\u2013499 (2006)","journal-title":"Mathematical Programming B"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Mathematical Programming\u00a098, 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Aragao, M., Reis, M., Uchoa, E., Werneck, R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming\u00a0106, 491\u2013511 (2006)","journal-title":"Mathematical Programming"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/ijoc.1090.0348","volume":"22","author":"M. Hewitt","year":"2010","unstructured":"Hewitt, M., Nemhauser, G., Savelsbergh, M.: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS Journal on Computing\u00a022, 314\u2013325 (2010)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Hewitt, M., Nemhauser, G., Savelsbergh, M.: Branch-and-price guided search for integer programs with an application to the multicommodity fixed charge network flow problem. To appear in INFORMS Journal on Computing (2012)","DOI":"10.1287\/ijoc.1120.0503"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"2266","DOI":"10.1016\/j.cor.2006.10.020","volume":"35","author":"M. Savelsbergh","year":"2008","unstructured":"Savelsbergh, M., Song, J.-H.: An optimization algorithm for inventory routing with continuous moves. Computers and Operations Research\u00a035, 2266\u20132282 (2008)","journal-title":"Computers and Operations Research"}],"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_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:02Z","timestamp":1620129362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}