A branch-and-cut algorithm for the maximum covering cycle problem
Year of publication: |
2020
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Sinnl, Markus |
Published in: |
Decomposition methods for hard optimization problems. - New York, NY, USA : Springer. - 2020, p. 487-499
|
Subject: | Covering problems | Branch-and-cut | Optimal cycle problems | Domination problems | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Mixed-integer programming approaches for the time-constrained maximal covering routing problem
Sinnl, Markus, (2021)
-
Exact algorithms for budgeted prize-collecting covering subgraph problems
Morandi, N., (2022)
-
On covering location problems on networks with edge demand
Berman, Oded, (2016)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Álvarez-Miranda, Eduardo, (2017)
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
- More ...