Solving the minimum-cost double Roman domination problem
Year of publication: |
2024
|
---|---|
Authors: | Klobučar Barišić, Ana ; Manger, Robert |
Published in: |
Central European journal of operations research. - Heidelberg : Physica-Verl., ISSN 1613-9178, ZDB-ID 2093829-9. - Vol. 32.2024, 3, p. 793-817
|
Subject: | Complexity | Dominating set | Double Roman domination | Dynamic programming | Heuristic | Minimum cost | Altertum | Ancient history | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung |
-
A heuristic for variable size multiobjective two-dimensional bin packing
Liu, Ya, (2014)
-
A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines
Gerstl, Enrique, (2013)
-
Minimizing makespan on a single machine with release dates and inventory constraints
Davari, Morteza, (2020)
- More ...
-
A fast approximate implementation of the work function algorithm for solving the k-server problem
Rudec, Tomislav, (2015)
-
A new approach to solve the k-server problem based on network flows and flow cost reduction
Rudec, Tomislav, (2013)
-
A fast work function algorithm for solving the k-server problem
Rudec, Tomislav, (2013)
- More ...