Complexity and Approximation of the Continuous Network Design Problem.

Martin Gairing Tobias Harks Max Klimm

Published in: APPROX-RANDOM (2014)

Keyphrases

network design problem
approximation algorithms
worst case
network design
computational complexity
mixed integer
neural network
np hard
branch and bound
mixed integer programming
transportation networks
lower bound
upper bound
shortest path
combinatorial optimization
minimal cost