Mixed-integer programming approaches for the time-constrained maximal covering routing problem
Year of publication: |
2021
|
---|---|
Authors: | Sinnl, Markus |
Published in: |
OR spectrum : quantitative approaches in management. - Berlin : Springer, ISSN 1436-6304, ZDB-ID 1467029-X. - Vol. 43.2021, 2, p. 497-542
|
Subject: | Routing problems | Covering problems | Branch-and-cut | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
A branch-and-cut algorithm for the maximum covering cycle problem
Álvarez-Miranda, Eduardo, (2020)
-
Exact algorithms for budgeted prize-collecting covering subgraph problems
Morandi, N., (2022)
-
Schulz, Arne, (2024)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
Benders Decomposition Algorithms for Minimizing the Spread of Harmful Contagions in Networks
Tanınmış, Kübra, (2023)
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
- More ...