A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem.

Ivana Ljubic Peter Putz Juan José Salazar González

Published in: INOC (2011)

Keyphrases

network design problem
prize collecting
network design
approximation algorithms
mixed integer
transportation networks
branch and bound
minimal cost
mixed integer programming
travel time
valid inequalities
search strategies
lagrangian relaxation
cutting plane