Complexity and Approximation of the Continuous Network Design Problem.

Martin Gairing Tobias Harks Max Klimm

Published in: SIAM J. Optim. (2017)

Keyphrases

network design problem
approximation algorithms
worst case
network design
transportation networks
branch and bound
computational complexity
np hard
lagrangian relaxation
lower bound
special case
minimal cost
feasible solution
mixed integer
mixed integer programming