Login / Signup
Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
Eduardo Álvarez-Miranda
Valentina Cacchiani
Andrea Lodi
Tiziano Parriani
Daniel R. Schmidt
Published in:
Eur. J. Oper. Res. (2014)
Keyphrases
</>
network design problem
single commodity
network design
valid inequalities
branch and bound
approximation algorithms
heuristic solution
computational complexity
integer programming
lagrangian relaxation
minimal cost
genetic algorithm
lower bound
mixed integer
mixed integer programming
network flow problem