A branch-and-cut algorithm for the partitioning-hub location-routing problem
| Year of publication: |
2011
|
|---|---|
| Authors: | Catanzaro, Daniele ; Gourdin, Eric ; Labbé, Martine ; Özsoy, F. Aykut |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 38.2011, 2, p. 539-549
|
| Subject: | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming |
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
-
A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection
Montagné, Romain, (2019)
-
Pecin, Diego, (2019)
- More ...
-
Improved integer linear programming formulations for the job sequencing and tool switching problem
Catanzaro, Daniele, (2015)
-
The balanced minimum evolution problem
Catanzaro, Daniele, (2012)
-
A class representative model for pure parsimony haplotyping
Catanzaro, Daniele, (2010)
- More ...