Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Year of publication: |
2015
|
---|---|
Authors: | Thiongane, Babacar ; Cordeau, Jean-François ; Gendron, Bernard |
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. 53.2015, p. 1-8
|
Subject: | Nonbifurcated hop-constrained multicommodity network design problem | Formulations | Relaxations | Lagrangean relaxation | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Operations Research | Operations research | Heuristik | Heuristics | Unternehmensnetzwerk | Business network | Lieferkette | Supply chain | Mathematische Optimierung | Mathematical programming |
-
Algorithmic approaches to the multiple knapsack assignment problem
Martello, Silvano, (2019)
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
-
Nassief, W., (2016)
- More ...
-
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson, (2009)
-
An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
Contardo, Claudio, (2014)
-
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson M., (2009)
- More ...