The robust network loading problem with dynamic routing
Year of publication: |
2013
|
---|---|
Authors: | Mattia, Sara |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 54.2013, 3, p. 619-643
|
Publisher: |
Springer |
Subject: | Network design | Demand uncertainty | Branch-and-cut |
-
A branch-and-cut algorithm for two-level survivable network design problems
Rodríguez-Martín, Inmaculada, (2016)
-
Two-stage approach to the intermodal terminal location problem
Lin, Chang-Chun, (2016)
-
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
Gendron, Bernard, (2016)
- More ...
-
Separating tight metric inequalities by bilevel programming
Mattia, Sara, (2012)
-
A branch-and-cut algorithm for the restricted Block Relocation Problem
Bacci, Tiziano, (2020)
-
The bounded beam search algorithm for the block relocation problem
Bacci, Tiziano, (2019)
- More ...