{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:36:36Z","timestamp":1746318996015,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_14","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"181-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reoptimization Techniques for MIP Solvers"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Gamrath","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Hiller","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Witzig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"14_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, TU Berlin (2007)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation 1(1), 1\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung Extra Volume ICM III, 645\u2013656 (1998)","DOI":"10.4171\/dms\/1-3\/62"},{"key":"14_CR4","unstructured":"COLOR02\/03\/04. http:\/\/mat.gsia.cmu.edu\/COLOR03\/"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. The Computer Journal 8(3), 250\u2013255 (1965)","journal-title":"The Computer Journal"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-72792-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"E Danna","year":"2007","unstructured":"Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 280\u2013294. Springer, Heidelberg (2007)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8(1), 101\u2013111 (1960)","journal-title":"Operations Research"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/0377-2217(88)90034-3","volume":"35","author":"M Desrochers","year":"1988","unstructured":"Desrochers, M., Soumis, F.: A reoptimization algorithm for the shortest path problem with time windows. European J. Oper. Res. 35(2), 242\u2013254 (1988)","journal-title":"European J. Oper. Res."},{"key":"14_CR9","unstructured":"DIP - Decomposition for Int. Programming. https:\/\/projects.coin-or.org\/Dip"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00373-007-0711-6","volume":"23","author":"M Fischetti","year":"2007","unstructured":"Fischetti, M., Lodi, A.: Mipping closures: An instant survey. Graphs and Combinatorics 23, 233\u2013243 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M Fischetti","year":"2007","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e1tal closure. Math. Program., Ser. B 110, 3\u201320 (2007)","journal-title":"Math. Program., Ser. B"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Frangioni, A., Manca, A.: A computational study of cost reoptimization for min cost flow problems. INFORMS Journal on Computing 18(1) (2006)","DOI":"10.1287\/ijoc.1040.0081"},{"key":"14_CR13","unstructured":"Gamrath, G.: Generic branch-cut-and-price. Master\u2019s thesis, TU Berlin (2010)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-13193-6_21","volume-title":"Experimental Algorithms","author":"G Gamrath","year":"2010","unstructured":"Gamrath, G., L\u00fcbbecke, M.E.: Experiments with a generic dantzig-wolfe decomposition for integer programs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 239\u2013252. Springer, Heidelberg (2010)"},{"key":"14_CR15","unstructured":"GCG - Generic Column Generation. http:\/\/www.or.rwth-aachen.de\/gcg\/"},{"key":"14_CR16","unstructured":"G\u00fczelsoy, M.: Dual methods in mixed integer linear programming. Ph.D. thesis, Lehigh University, Bethlehem, Pennsylvania, USA (2009)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-38527-8_33","volume-title":"Experimental Algorithms","author":"B Hiller","year":"2013","unstructured":"Hiller, B., Klug, T., Witzig, J.: Reoptimization in branch-and-bound algorithms with an application to elevator control. In: Demetrescu, C., Marchetti-Spaccamela, A., Bonifaci, V. (eds.) SEA 2013. LNCS, vol. 7933, pp. 378\u2013389. Springer, Heidelberg (2013)"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"FK Karzan","year":"2009","unstructured":"Karzan, F.K., Nemhauser, G.L., Savelsbergh, M.W.P.: Information-based branching schemes for binary linear mixed integer problems. Mathematical Programming Computation 1(4), 249\u2013293 (2009)","journal-title":"Mathematical Programming Computation"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2010.10.027","volume":"39","author":"L L\u00e9tocart","year":"2012","unstructured":"L\u00e9tocart, L., Nagih, A., Plateau, G.: Reoptimization in Lagrangian methods for the 0\u20131 quadratic knapsack problem. Comput. Oper. Res. 39(1), 12\u201318 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1287\/trsc.1040.0112","volume":"39","author":"E Miller-Hooks","year":"2005","unstructured":"Miller-Hooks, E., Yang, B.: Updating paths in time-varying networks given arc weight changes. Transportation Science 39(4), 451\u2013464 (2005)","journal-title":"Transportation Science"},{"key":"14_CR22","unstructured":"Ralphs, T.K., Galati, M.V.: Decomposition in integer linear programming. In: Karlof, J.K. (ed.) Integer Programming: Theory and Practice. CRC Press (2006)"},{"key":"14_CR23","unstructured":"Ralphs, T.K., G\u00fczelsoy, M.: Duality and warm starting in integer programming. In: The Proceedings of the 2006 NSF Design, Service, and Manufacturing Grantees and Research Conference (2006)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing 6, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"14_CR25","unstructured":"SCIP - Solving Constraint Integer Programs. http:\/\/scip.zib.de\/"},{"key":"14_CR26","unstructured":"Tanaka, M., Kobayashi, K.: MISOCP formulation and route generation algorithm for ship navigation problem. Tech. Rep. 2013\u20138, Tokyo Inst. of Technology (2013)"},{"key":"14_CR27","unstructured":"Witzig, J.: Reoptimization Techniques for MIP Solvers. Master\u2019s thesis, TU Berlin (2014)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T16:19:50Z","timestamp":1691770790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}