Solving the minimum-cost double Roman domination problem.
Ana Klobucar BarisicRobert MangerPublished in: Central Eur. J. Oper. Res. (2024)
Keyphrases
- minimum cost
- network flow problem
- linear relaxation
- np hard
- network flow
- approximation algorithms
- capacity constraints
- spanning tree
- network simplex algorithm
- minimum cost flow
- integer programming
- minimal cost
- combinatorial optimization
- multistage
- linear programming
- mobile robot
- edit operations
- multi objective
- evolutionary algorithm