{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:52:09Z","timestamp":1726059129256},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_5","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:02:40Z","timestamp":1573700560000},"page":"69-81","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"No\u00e9","family":"Godinho","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"5_CR1","unstructured":"Ginac C++ libraries. \nhttps:\/\/www.ginac.de\/"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/11561071_76","volume-title":"Algorithms \u2013 ESA 2005","author":"H Aissi","year":"2005","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 862\u2013873. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11561071_76"},{"key":"5_CR3","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Pseudo-polynomial time algorithms for min-max and min-max regret problems. In: Proceedings of the 5th International Symposium on Operations Research and Its Applications, pp. 171\u2013178 (2005)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(87)90067-9","volume":"16","author":"JF Barahona","year":"1987","unstructured":"Barahona, J.F., Pulleyblank, R.: Exact arborescences, matching and cycles. Discrete Appl. Math. 16, 91\u201399 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1007\/s11590-015-0949-5","volume":"10","author":"A Chassein","year":"2016","unstructured":"Chassein, A., Goerigk, M.: On the recoverable robust traveling salesman problem. Optim. Lett. 10(7), 1479\u20131492 (2016)","journal-title":"Optim. Lett."},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Muticriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Muticriteria Optimization, 2nd edn. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/3-540-27659-9","edition":"2"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10589-013-9551-x","volume":"56","author":"JR Figueira","year":"2013","unstructured":"Figueira, J.R., Paquete, L., Sim\u00f5es, M., Vanderpooten, D.: Algorithmic improvements on dynamic programming for the bi-objective $$\\{0,1\\}$$ knapsack problem. Comput. Optim. Appl. 56(1), 97\u2013111 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0207024","volume":"7","author":"NG Harold","year":"1978","unstructured":"Harold, N.G., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM J. Comput. 7(3), 280\u2013287 (1978)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"5_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"CP Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1\u20132), 67\u2013100 (2000)","journal-title":"J. Autom. Reason."},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"1","key":"5_CR11","first-page":"37","volume":"24","author":"M Makuchowski","year":"2014","unstructured":"Makuchowski, M.: Perturbation algorithm for a minimax regret minimum spanning tree problem. Oper. Res. Decis. 24(1), 37\u201349 (2014)","journal-title":"Oper. Res. Decis."},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.ejor.2003.10.008","volume":"161","author":"R Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.M.: A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161(3), 771\u2013779 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","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.: A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. 32(3), 225\u2013232 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/ijoc.1090.0342","volume":"22","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22(3), 371\u2013386 (2010)","journal-title":"INFORMS J. Comput."},{"key":"5_CR15","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-46618-2_15","volume-title":"Recent Advances and Historical Development of Vector Optimization","author":"P Serafini","year":"1987","unstructured":"Serafini, P.: Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn, J., Krabs, W. (eds.) Recent Advances and Historical Development of Vector Optimization. LNEMS, vol. 294, pp. 222\u2013232. Springer, Heidelberg (1987). \nhttps:\/\/doi.org\/10.1007\/978-3-642-46618-2_15"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3), 472\u2013484 (2008)","journal-title":"INFORMS J. Comput."},{"key":"5_CR17","doi-asserted-by":"publisher","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.: The robust spanning tree problem with interval data. Oper. Res. Lett. 29, 31\u201340 (2001)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:07:40Z","timestamp":1573700860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}