{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:33:45Z","timestamp":1693870425399},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,3]],"date-time":"2006-06-03T00:00:00Z","timestamp":1149292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,27]]},"DOI":"10.1007\/s10107-006-0008-1","type":"journal-article","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T12:11:40Z","timestamp":1149250300000},"page":"431-441","source":"Crossref","is-referenced-by-count":12,"title":["Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty"],"prefix":"10.1007","volume":"110","author":[{"given":"H.","family":"Yaman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. E.","family":"Kara\u015fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. \u00c7.","family":"P\u0131nar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0167-6377(03)00058-0","volume":"32","author":"I.D. Aron","year":"2004","unstructured":"Aron I.D., Van Hentenryck P. (2004) On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32: 36\u201340","journal-title":"Oper. Res. Lett."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I. Averbakh","year":"2001","unstructured":"Averbakh I. (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Prog. 90: 263\u2013272","journal-title":"Math. Prog."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A. Ben-Tal","year":"1998","unstructured":"Ben-Tal A., Nemirovski A. (1998) Robust convex optimization. Math. OR. 23: 769\u2013805","journal-title":"Math. OR."},{"key":"8_CR4","volume-title":"Lectures on modern convex optimization: analysis, algorithms and engineering applications","author":"A. Ben-Tal","year":"2000","unstructured":"Ben-Tal A., Nemirovski A. (2000) Lectures on modern convex optimization: analysis, algorithms and engineering applications. SIAM-MPS, Philadelphia"},{"key":"8_CR5","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. (2003) Robust discrete optimization and network flows. Math. Prog. B 98: 49\u201371","journal-title":"Math. Prog. B"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas D., Sim M. (2004) The price of robustness. Oper. Res. 52: 35\u201353","journal-title":"Oper. Res."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-003-0474-7","volume":"100","author":"E. Conde","year":"2004","unstructured":"Conde E. (2004) An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Math. Prog. 100: 345\u2013353","journal-title":"Math. Prog."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L. El-Ghaoui","year":"1997","unstructured":"El-Ghaoui L., Lebret H. (1997) Robust solutions to least squares problems under uncertain data matrices. SIAM J. Matrix Anal. Appl. 18: 1035\u20131064","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis P., Yu G. (1997) Robust discrete optimization and applications. Kluwer, Boston"},{"issue":"5","key":"8_CR10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1111\/j.1475-3995.1998.tb00122.x","volume":"5","author":"H.E. Mausser","year":"1998","unstructured":"Mausser H.E., Laguna M. (1998) A new mixed integer formulation for the maximum regret problem. Int. Trans. Oper. Res. 5(5): 389\u2013403","journal-title":"Int. Trans. Oper. Res."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.ejor.2003.10.008","volume":"161","author":"R. Montemanni","year":"2005","unstructured":"Montemanni R., Gambardella L.M. (2005) A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161: 771\u2013729","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.orl.2003.08.002","volume":"32","author":"R. Montemanni","year":"2004","unstructured":"Montemanni R., Gambardella L.M., Donati A.V. (2004) A branch and bound for the robust shortest path problem with interval data. Oper. Res. Lett. 32: 225\u2013232","journal-title":"Oper. Res. Lett."},{"key":"8_CR13","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver A. (1987) Theory of linear and integer programming. Wiley, New York"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"H. Yaman","year":"2001","unstructured":"Yaman H., Kara\u015fan O.E., P\u0131nar M.\u00c7. (2001) The robust spanning tree problem with interval data. Oper. Res. Lett. 29: 31\u201340","journal-title":"Oper. Res. Lett."},{"key":"8_CR15","unstructured":"Yaman, H., Kara\u015fan, O.E., P\u0131nar, M.\u00c7. Restricted robust optimization for maximization over uniform matroid with interval data uncertainty. Technical report, Bilkent University, Ankara, Turkey, www.ie.bilkent.edu.tr\/~mustafap\/pubs\/psecrev.pdf (2005)"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P. Zielinski","year":"2004","unstructured":"Zielinski P. (2004) The computational complexity of the relative robust short path problem with interval data. Eur. J. Oper. Res. 158: 570\u2013576","journal-title":"Eur. J. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0008-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0008-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0008-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:00Z","timestamp":1559123400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0008-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,27]]}},"alternative-id":["8"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0008-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,3]]}}}