Affine recourse for the robust network design problem: Between static and dynamic routing.

Michael Poss Christian Raack

Published in: Networks (2013)

Keyphrases

network design problem
network design
shortest path
approximation algorithms
mixed integer
benders decomposition
transportation networks
branch and bound
integer programming
mixed integer programming
lagrangian relaxation
routing problem
bayesian networks
linear program
multistage
graph cuts
evolutionary algorithm