On Generalizations of Network Design Problems with Degree Bounds.

Nikhil Bansal Rohit Khandekar Jochen Könemann Viswanath Nagarajan Britta Peis

Published in: IPCO (2010)

Keyphrases

network design problem
approximation algorithms
branch and bound
network design
lower bound
network flow problem
capacitated fixed charge
worst case
minimal cost
upper bound
integer programming
lower and upper bounds
mixed integer
valid inequalities
exact solution
neural network
endpoints
genetic algorithm