A Branch & Cut algorithm for the prize-collecting capacitated location routing problem
Year of publication: |
2021
|
---|---|
Authors: | Negrotto, Daniel ; Loiseau, Irene |
Published in: |
Top : an official journal of the Spanish Society of Statistics and Operations Research. - Berlin : Springer, ISSN 1863-8279, ZDB-ID 2322573-7. - Vol. 29.2021, 1, p. 34-57
|
Subject: | Location-routing problem | Vehicle routing | Integer linear programming | Branch & Cut | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Transportproblem | Transportation problem | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm |
-
Fazayeli, Saeed, (2018)
-
An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
Contardo, Claudio, (2014)
-
Jafari, Mohammad Javad, (2023)
- More ...
-
Editorial: tutorials in operations research
Ribeiro, Celso C., (2012)
-
A linear programming approach for adaptive synchronization of traffic signals
Coll, Pablo, (2013)
-
A linear programming approach for adaptive synchronization of traffic signals
Coll, Pablo, (2013)
- More ...