16 citations · 54 across the 22 of their papers we have counts for
5 papers · 1 filter
A note on computational approaches for the antibandwidth problem
Markus Sinnl
In this note, we consider the antibandwidth problem, also known as dual bandwidth problem, separation problem and maximum differential coloring problem. Given a labeled graph (i.e.…
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…
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…
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…
Algorithmic expedients for the S-labeling problem
Markus Sinnl
Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in whic…