Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
| Year of publication: |
2014
|
|---|---|
| Authors: | Gendron, Bernard ; Larose, Mathieu |
| Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 2.2014, 1/2, p. 55-75
|
| Subject: | Multicommodity capacitated fixed-charge network design | Column generation | Branch-and-price-and-cut | Operations Research | Operations research | Heuristik | Heuristics | Transportproblem | Transportation problem | Dynamische Optimierung | Dynamic programming | USA | United States | Theorie | Theory |
-
Fixed-charge transportation problems on trees
Angulo, Gustavo, (2017)
-
Clautiaux, François, (2019)
-
Yaghini, M., (2013)
- More ...
-
Technology and the human condition
Gendron, Bernard, (1977)
-
A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"
Gendron, Bernard, (2002)
-
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson, (2009)
- More ...