A local branching heuristic for the capacitated fixed-charge network design problem
Year of publication: |
2010
|
---|---|
Authors: | Rodríguez-Martín, Inmaculada ; Salazar-González, Juan José |
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. 37.2010, 3, p. 575-581
|
Subject: | Operations Research | Operations research | Heuristik | Heuristics | Transportproblem | Transportation problem | Ganzzahlige Optimierung | Integer programming | USA | United States |
-
Solving time minimising transhipment problem
Khurana, Archana, (2015)
-
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Gendron, Bernard, (2014)
-
The fixed-charge shortest-path problem
Engineer, Faramroze G., (2012)
- More ...
-
Solving a capacitated hub location problem
Rodríguez-Martín, Inmaculada, (2008)
-
Rodríguez-Martín, Inmaculada, (2012)
-
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
Hernández-Pérez, Hipólito, (2009)
- More ...