Exact and heuristic algorithms for the weighted total domination problem
Year of publication: |
2021
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Sinnl, Markus |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 127.2021, p. 1-17
|
Subject: | Domination problem | Branch-and-cut | Greedy heuristic | Genetic algorithm | Theorie | Theory | Heuristik | Heuristics | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Evolutionärer Algorithmus | Evolutionary algorithm | Scheduling-Verfahren | Scheduling problem |
-
Kim, Jae-Gon, (2020)
-
He, Xuan, (2024)
-
Khare, Ankit, (2021)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
An exact solution framework for the multiple gradual cover location problem
Álvarez-Miranda, Eduardo, (2019)
-
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
Álvarez-Miranda, Eduardo, (2017)
- More ...