Noé Godinho, Luís Paquete. A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem. In Ilias Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas, editors, Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers. Volume 11544 of Lecture Notes in Computer Science, pages 69-81, Springer, 2019. [doi]
@inproceedings{GodinhoP19,
title = {A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem},
author = {Noé Godinho and Luís Paquete},
year = {2019},
doi = {10.1007/978-3-030-34029-2_5},
url = {https://doi.org/10.1007/978-3-030-34029-2_5},
researchr = {https://researchr.org/publication/GodinhoP19},
cites = {0},
citedby = {0},
pages = {69-81},
booktitle = {Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
editor = {Ilias Kotsireas and Panos M. Pardalos and Konstantinos E. Parsopoulos and Dimitris Souravlias and Arsenis Tsokas},
volume = {11544},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-34029-2},
}