{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:31:42Z","timestamp":1726425102318},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,9,6]],"date-time":"2006-09-06T00:00:00Z","timestamp":1157500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,1,23]]},"DOI":"10.1007\/s10898-006-9074-4","type":"journal-article","created":{"date-parts":[[2006,9,5]],"date-time":"2006-09-05T08:59:49Z","timestamp":1157446789000},"page":"467-480","source":"Crossref","is-referenced-by-count":6,"title":["A Branch and Bound algorithm for the minimax regret spanning arborescence"],"prefix":"10.1007","volume":"37","author":[{"given":"Eduardo","family":"Conde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,6]]},"reference":[{"issue":"1","key":"9074_CR1","first-page":"136","volume":"32","author":"I. Aron","year":"2003","unstructured":"Aron I., Van Hentenryck P. (2003) On the complexity of the robust spanning tree with interval data. Oper. Res. Lett. 32(1): 136\u2013140","journal-title":"Oper. Res. Lett."},{"key":"9074_CR2","unstructured":"Aron, I., Van Hentenryck, P.: A constraint satisfaction approach to the robust spanning tree with interval data. Proceedings of the 18th conference on uncertainty in artificial intelligence (UAI), (August 2002)"},{"key":"9074_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I. Averbakh","year":"2004","unstructured":"Averbakh I., Lebedev V. (2004) Interval data minmax regret network optimization problems. Discrete Applied Mathematics, 138, 289\u2013301","journal-title":"Discrete Applied Mathematics,"},{"key":"9074_CR4","doi-asserted-by":"crossref","unstructured":"Conde, E., Candia, A.: Minimax regret spanning arborescences under uncertain costs. Eur. J. Operational Res. (in Press) (2006)","DOI":"10.1016\/j.ejor.2006.07.036"},{"key":"9074_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds J. (1967) Optimum branching. J. Res. Nat. Bureau of Standards, 71B: 233\u2013240","journal-title":"J. Res. Nat. Bureau of Standards."},{"key":"9074_CR6","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Wolsey, L.: Optimal trees, in: Network models, handbook in operations research and management science. In: Ball, M.O. et\u00a0al. (eds.), vol. 7, pp. 503\u2013615. North-Holland Amsterdam (1995)","DOI":"10.1016\/S0927-0507(05)80126-4"},{"issue":"3","key":"9074_CR7","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1016\/j.ejor.2005.02.060","volume":"174","author":"R. Montemanni","year":"2006","unstructured":"Montemanni R. (2006) A Benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Operational Res. 174(3): 1479\u20131490","journal-title":"Eur. J. Operational Res."},{"issue":"3","key":"9074_CR8","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. Operational Res. 161(3): 771\u2013779","journal-title":"Eur. J. Operational Res."},{"issue":"1","key":"9074_CR9","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., Karasan O.E., Pinar M.\u00c7. (2001) The robust spanning tree problem with interval data. Operations Res. Lett. 29(1): 31\u201340","journal-title":"Operations Res. Lett."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9074-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9074-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9074-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:06Z","timestamp":1559304726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9074-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,1,23]]}},"alternative-id":["9074"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9074-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,6]]}}}