Network Design Problem by Link Protection to Keep Small Increase of Path Length during Link Failures.

Kohei Nishida Hiroyoshi Miwa

Published in: INCoS (2013)

Keyphrases

path length
network design problem
link failure
network design
shortest path
approximation algorithms
network topology
branch and bound
mixed integer programming
minimal cost
small world
routing protocol
lagrangian relaxation
transportation networks
network architecture