{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:43:12Z","timestamp":1725900192548},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_33","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"378-389","source":"Crossref","is-referenced-by-count":2,"title":["Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Hiller","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Klug","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Witzig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and Approximation in Reoptimization. In: Computability in Context: Computation and Logic in the Real World. Imperial College Press\/World Scientific (2011)","DOI":"10.1142\/9781848162778_0004"},{"key":"33_CR2","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.\u00a035, 242\u2013254 (1988)","journal-title":"European J. Oper. Res."},{"key":"33_CR3","unstructured":"DIP \u2013 Decomposition for Integer Programming, \n                    \n                      https:\/\/projects.coin-or.org\/Dip"},{"issue":"13","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1908","DOI":"10.1016\/j.dam.2006.03.034","volume":"154","author":"P. Friese","year":"2006","unstructured":"Friese, P., Rambau, J.: Online-optimization of a multi-elevator transport system with reoptimization algorithms based on set-partitioning models. Discrete Appl. Math.\u00a0154(13), 1908\u20131931 (2006)","journal-title":"Discrete Appl. Math."},{"key":"33_CR5","unstructured":"Galati, M.: Decomposition in Integer Linear Programming. PhD thesis, Lehigh University (2009)"},{"key":"33_CR6","unstructured":"Gamrath, G.: Generic branch-cut-and-price. Diploma thesis, TU Berlin (2010)"},{"key":"33_CR7","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.\u00a06049, pp. 239\u2013252. Springer, Heidelberg (2010)"},{"key":"33_CR8","unstructured":"GCG \u2013 Generic Column Generation, \n                    \n                      http:\/\/www.or.rwth-aachen.de\/gcg\/"},{"key":"33_CR9","unstructured":"Hiller, B.: Online Optimization: Probabilistic Analysis and Algorithm Engineering. PhD thesis, TU Berlin (2009)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Hiller, B., Klug, T., Tuchscherer, A.: An exact reoptimization algorithm for the scheduling of elevator groups. Flexible Services and Manufacturing Journal (to appear)","DOI":"10.1007\/s10696-013-9175-6"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/3-540-45749-6_56","volume-title":"Algorithms - ESA 2002","author":"S.O. Krumke","year":"2002","unstructured":"Krumke, S.O., Rambau, J., Torres, L.M.: Real-time dispatching of guided and unguided automobile service units with soft time windows. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 637\u2013648. Springer, Heidelberg (2002)"},{"issue":"1","key":"33_CR12","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 quadratic knapsack problem. Comput. Oper. Res.\u00a039(1), 12\u201318 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"33_CR13","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 with arc weight changes. Transportation Sci.\u00a039(4), 451\u2013464 (2005)","journal-title":"Transportation Sci."},{"key":"33_CR14","unstructured":"Witzig, J.: Effiziente Reoptimierung in Branch&Bound-Verfahren f\u00fcr die Steuerung von Aufz\u00fcgen. Bachelor thesis, TU Berlin (2013)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T09:39:13Z","timestamp":1547977153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}