3 papers
math.OC2019
Exact and heuristic algorithms for the weighted total domination problem
Eduardo Álvarez-Miranda, Markus Sinnl
Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this pa…
math.OC2019
An exact solution framework for the multiple gradual cover location problem
Eduardo Álvarez-Miranda, Markus Sinnl
Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many ot…
math.OC2019
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubić +1
The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservation of endangered wildlife. In order to guarantee the preservation of species and…