A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem

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]

Abstract

Abstract is missing.