Complexity and Approximation of the Continuous Network Design Problem.

Martin Gairing Tobias Harks Max Klimm

Published in: CoRR (2013)

Keyphrases

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