{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T05:34:54Z","timestamp":1782192894138,"version":"3.54.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T00:00:00Z","timestamp":1467590400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/http:\/\/dx.doi.org","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2013\/09\/B\/ST6\/01525"],"award-info":[{"award-number":["2013\/09\/B\/ST6\/01525"]}],"id":[{"id":"10.13039\/http:\/\/dx.doi.org","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/http:\/\/dx.doi.org","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2013\/09\/B\/ST6\/01525"],"award-info":[{"award-number":["2013\/09\/B\/ST6\/01525"]}],"id":[{"id":"10.13039\/http:\/\/dx.doi.org","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/http:\/\/dx.doi.org","name":"Politechnika Wroclawska","doi-asserted-by":"publisher","award":["S50129\/K1102"],"award-info":[{"award-number":["S50129\/K1102"]}],"id":[{"id":"10.13039\/http:\/\/dx.doi.org","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-016-1057-x","type":"journal-article","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T11:53:02Z","timestamp":1467633182000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The recoverable robust spanning tree problem with interval costs is polynomially solvable"],"prefix":"10.1007","volume":"11","author":[{"given":"Mikita","family":"Hradovich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Kasperski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Zieli\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,4]]},"reference":[{"key":"1057_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows:theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, New Jersey (1993)"},{"key":"1057_CR2","unstructured":"B\u00fcsing, C: Recoverable robustness in combinatorial optimization. Ph.D. thesis, Technical University of Berlin, Berlin (2011)"},{"key":"1057_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.20487","volume":"59","author":"C B\u00fcsing","year":"2012","unstructured":"B\u00fcsing, C.: Recoverable robust shortest path problems. Networks 59, 181\u2013189 (2012)","journal-title":"Networks"},{"key":"1057_CR4","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s11590-011-0307-1","volume":"5","author":"C B\u00fcsing","year":"2011","unstructured":"B\u00fcsing, C., Koster, A.M.C.A., Kutschka, M.: Recoverable robust knapsacks: the discrete scenario case. Optim. Lett. 5, 379\u2013392 (2011)","journal-title":"Optim. Lett."},{"key":"1057_CR5","doi-asserted-by":"publisher","unstructured":"Chassein, A., Goerigk, M.: On the recoverable robust traveling salesman problem. Optim. Lett. (2015). doi: 10.1007\/s11590-015-0949-5","DOI":"10.1007\/s11590-015-0949-5"},{"key":"1057_CR6","doi-asserted-by":"crossref","unstructured":"Liebchen, C., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Robust and Online Large-Scale Optimization, vol.\u00a05868 of Lecture Notes in Computer Science, pp. 1\u201327. Springer, New York (2009)","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"1057_CR7","unstructured":"Nasrabadi, E., Orlin, J.B.: Robust optimization with incremental recourse. CoRR (2013). arXiv:1312.4075"},{"key":"1057_CR8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.tcs.2010.10.006","volume":"412","author":"A Kasperski","year":"2011","unstructured":"Kasperski, A., Zieli\u0144ski, P.: On the approximability of robust spanning problems. Theor. Comput. Sci. 412, 365\u2013374 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1057_CR9","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Berlin (1997)","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"1057_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-319-00795-3_22","volume":"2012","author":"A Kasperski","year":"2014","unstructured":"Kasperski, A., Kurpisz, A., Zieli\u0144ski, P.: Recoverable robust combinatorial optimization problems. Oper. Res. Proc. 2012, 147\u2013153 (2014)","journal-title":"Oper. Res. Proc."},{"key":"1057_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49\u201371 (2003)","journal-title":"Math. Program."},{"key":"1057_CR12","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.1080.0607","volume":"57","author":"O \u015eeref","year":"2009","unstructured":"\u015eeref, O., Ahuja, R.K., Orlin, J.B.: Incremental network optimization: theory and algorithms. Oper. Res. 57, 586\u2013594 (2009)","journal-title":"Oper. Res."},{"key":"1057_CR13","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative methods in combinatorial optimization. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511977152"},{"key":"1057_CR14","first-page":"503","volume-title":"Network Models, Handbook in Operations Research and Management Science, vol.\u00a07","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal Trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models, Handbook in Operations Research and Management Science, vol.\u00a07, pp. 503\u2013615. North-Holland, Amsterdam (1995)"},{"key":"1057_CR15","unstructured":"Oxley, J.G.: Matroid theory. Oxford University Press, Oxford (1992)"},{"key":"1057_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971)","journal-title":"Math. Program."},{"key":"1057_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"WH Cunningham","year":"1984","unstructured":"Cunningham, W.H.: Testing membership in matroid polyhedra. J. Comb. Theory Ser. B 36, 161\u2013188 (1984)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1057-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1057-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1057-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1057-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T13:26:47Z","timestamp":1568122007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1057-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1057"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1057-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,4]]}}}