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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Beziehungsmarketing | Relationship marketing | Ganzzahlige Optimierung | Integer programming |
-
The multicommodity-ring location routing problem
Gianessi, Paolo, (2016)
-
Oliveira, Lucas de, (2016)
-
The clustered orienteering problem
Angelelli, E., (2014)
- More ...
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
ILP heuristics and a new exact method for bi-objective 0/1 ILPs : application to FTTx-network design
Leitner, Markus, (2016)
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
- More ...