{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:20:56Z","timestamp":1725603656386},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_19","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"215-226","source":"Crossref","is-referenced-by-count":2,"title":["Recoverable Robustness by Column Generation"],"prefix":"10.1007","author":[{"given":"P. C.","family":"Bouman","sequence":"first","affiliation":[]},{"given":"J. M.","family":"van den Akker","sequence":"additional","affiliation":[]},{"given":"J. A.","family":"Hoogeveen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Operations Research\u00a046, 316\u2013329 (1998)","journal-title":"Operations Research"},{"key":"19_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A. Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"19_CR3","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Heidelberg (1997)"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The Price of Robustness. Operations Research\u00a052(1), 35\u201353 (2004)","journal-title":"Operations Research"},{"unstructured":"B\u00fcsing, C., Koster, A.M.C.A., Kutschka, M.: Recoverable Robust Knapsacks: the Discrete Scenario Case (2010), \n                    \n                      ftp:\/\/ftp.math.tu-berlin.de\/pub\/Preprints\/combi\/Report-018-2010.pdf","key":"19_CR5"},{"unstructured":"Cacchiani, V., Caprara, A., Galli, L., Kroon, L., Maroti, G., Toth, P.: Recoverable Robustness for Railway Rolling Stock Planning. In: 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS 2008 (2008), \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1590\/","key":"19_CR6"},{"unstructured":"Caprara, A., Galli, L., Kroon, L.G., Mar\u00f3ti, G., Toth, P.: Robust Train Routing and Online Re-scheduling. In: ATMOS (2010), \n                    \n                      http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2747\/","key":"19_CR7"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-05465-5_2","volume-title":"Robust and Online Large-Scale Optimization","author":"S. Cicerone","year":"2009","unstructured":"Cicerone, S., D\u2019angelo, G., Di Stefano, G., Frigioni, D., Navarra, A., Schachtebeck, M., Sch\u00f6bel, A.: Recoverable Robustness in Shunting and Timetabling. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 28\u201360. Springer, Heidelberg (2009)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/SFCS.2005.42","volume-title":"Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005)","author":"K. Dhamdhere","year":"2005","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: Approximation algorithms for demand-robust covering problems. In: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 367\u2013378. IEEE Computer Society, Los Alamitos (2005)"},{"key":"19_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Germany (2004)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-05465-5_1","volume-title":"Robust and Online Large-Scale Optimization","author":"C. Liebchen","year":"2009","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R., Stiller, S.: Recoverable robustness. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 1\u201327. Springer, Heidelberg (2009)"},{"unstructured":"Puhl, C.: Recoverable robust shortest path problems. Report 034-2008. Mathematics. Technical University, Berlin (2008)","key":"19_CR12"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T15:34:55Z","timestamp":1554132895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}