Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem.
Alejandro ArbelaezDeepak MehtaBarry O'SullivanLuis QuesadaPublished in: ICTAI (2014)
Keyphrases
- network design problem
- approximation algorithms
- network design
- benders decomposition
- branch and bound
- transportation networks
- constraint programming
- integer programming
- mixed integer programming
- minimal cost
- demand points
- neural network
- mixed integer
- special case
- distributed databases
- np hard
- lagrangian relaxation
- search algorithm
- bayesian networks