%0 Conference Paper %1 conf/sea2/GodinhoP19 %A Godinho, Noé %A Paquete, Luís %B SEA² %D 2019 %E Kotsireas, Ilias S. %E Pardalos, Panos M. %E Parsopoulos, Konstantinos E. %E Souravlias, Dimitris %E Tsokas, Arsenis %I Springer %K dblp %P 69-81 %T A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem. %U http://dblp.uni-trier.de/db/conf/sea2/sea2019.html#GodinhoP19 %V 11544 %@ 978-3-030-34029-2

@inproceedings{conf/sea2/GodinhoP19, added-at = {2020-03-27T00:00:00.000+0100}, author = {Godinho, Noé and Paquete, Luís}, biburl = {https://www.bibsonomy.org/bibtex/290b1959ba5479915b6c69825bb765a9c/dblp}, booktitle = {SEA²}, crossref = {conf/sea2/2019}, editor = {Kotsireas, Ilias S. and Pardalos, Panos M. and Parsopoulos, Konstantinos E. and Souravlias, Dimitris and Tsokas, Arsenis}, ee = {https://doi.org/10.1007/978-3-030-34029-2_5}, interhash = {572d1f0475435c19bfcc0c1557d1a634}, intrahash = {90b1959ba5479915b6c69825bb765a9c}, isbn = {978-3-030-34029-2}, keywords = {dblp}, pages = {69-81}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-05-13T12:09:52.000+0200}, title = {A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem.}, url = {http://dblp.uni-trier.de/db/conf/sea2/sea2019.html#GodinhoP19}, volume = 11544, year = 2019 }