{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:11:30Z","timestamp":1725505890560},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779025"},{"type":"electronic","value":"9783540779032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77903-2_19","type":"book-chapter","created":{"date-parts":[[2008,3,19]],"date-time":"2008-03-19T09:48:02Z","timestamp":1205920082000},"page":"123-128","source":"Crossref","is-referenced-by-count":0,"title":["On a Class of Interval Data Minmax Regret CO Problems"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Candia-V\u00e9jar","sequence":"first","affiliation":[]},{"given":"Eduardo","family":"\u00c1lvarez-Miranda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I. Averbakh","year":"2001","unstructured":"I. Averbakh, On the complexity of a class of combinatorial optimization problems with uncertainty, Mathematical Programming, Ser.A 90 (2001) 263\u2013272.","journal-title":"Mathematical Programming, Ser.A"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I. Averbakh","year":"2004","unstructured":"I. Averbakh and Lebedev, Interval data min-max regret network optimization problems, Discrete Applied Mathematics 138 (2004) 289\u2013301.","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ejor.2006.07.036","volume":"182","author":"E. Conde","year":"2007","unstructured":"E. Conde and A. Candia, Minmax regret spanning arborescences under uncertain costs, European Journal of Operational Research 182 (2007) 561\u2013577.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"D. Eppstein, Finding the k Shortest Paths, SIAM J. Comput. 28(2) (1998) 652\u2013673.","journal-title":"SIAM J. Comput"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A. Kasperski","year":"2006","unstructured":"A. Kasperski and P. Zielinski, An approximation algorithm for interval data minmax regret combinatorial optimization problems, Information Processing Letters 97 (2006) 177\u2013180.","journal-title":"Information Processing Letters"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and Its Applications","author":"P. Kouvelis","year":"1997","unstructured":"P. Kouvelis and G. Yu, Robust discrete optimization and Its Applications, Kluwer Academic Publishers, Boston, 1997."},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1016\/j.ejor.2005.02.060","volume":"174","author":"R. Montemanni","year":"2006","unstructured":"R. Montemanni, A Benders decomposition approach for the robust spanning tree problem with interval data, European Journal of Operational Research 174(3) (2006) 1479\u20131490.","journal-title":"European Journal of Operational Research"},{"key":"19_CR8","unstructured":"R. Montemanni, J. Barta and L. M. Gambardella, Heuristic and preprocessing techniques for the robust traveling salesman problem with interval data, Technical Report IDSIA-01-06."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"H. Yaman","year":"2001","unstructured":"H. Yaman, O.E. Karasan and M.C. Pinar, The robust spanning tree problem with interval data, Operations Research Letters 29 (2001) 31\u201340.","journal-title":"Operations Research Letters"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P. Zielinski","year":"2004","unstructured":"P. Zielinski, The computational complexity of the relative robust shortest path probem with interval data, European Journal of Operational Research 158 (2004) 570\u2013576.","journal-title":"European Journal of Operational Research"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77903-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:22Z","timestamp":1619520922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77903-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779025","9783540779032"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77903-2_19","relation":{},"subject":[]}}