A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.

Stefan Gollowitzer Luis Eduardo Neves Gouveia Ivana Ljubic

Published in: INOC (2011)

Keyphrases

network design problem
directed graph
graph structure
approximation algorithms
network design
capacitated fixed charge
network flow problem
minimum cost
shortest path
branch and bound
transportation networks
mixed integer
lagrangian relaxation
integer programming
minimal cost