Revisiting the Hamiltonian p-median problem : a new formulation on directed graphs and a branch-and-cut algorithm
Year of publication: |
2019
|
---|---|
Authors: | Bektaş, Tolga ; Gouveia, Luís ; Santos, Daniel |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 276.2019, 1 (1.7.), p. 40-64
|
Subject: | Combinatorial optimization | Hamiltonian p-median | Multi-cut inequalities | Multi-depot routing | Branch-and-cut algorithm | Theorie | Theory | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
The Hamiltonian p-median problem : polyhedral results and branch-and-cut algorithms
Barbato, Michele, (2024)
-
Karaoğlan, Ismail, (2017)
-
Pecin, Diego, (2019)
- More ...
-
Compact formulations for multi-depot routing problems : theoretical and computational comparisons
Bektaş, Tolga, (2020)
-
Prize collecting Steiner trees with node degree dependent costs
Gouveia, Luís, (2011)
-
Solving the variable size bin packing problem with discretized formulations
Correia, Isabel, (2008)
- More ...