The complexity of the network design problem.

David S. Johnson Jan Karel Lenstra A. H. G. Rinnooy Kan

Published in: Networks (1978)

Keyphrases

network design problem
approximation algorithms
network design
worst case
branch and bound
minimal cost
transportation networks
benders decomposition
computational complexity
computationally expensive
mixed integer
np hard