Lower bounding techniques for the degree-constrained network design problem.
Güvenç SahinRavindra K. AhujaPublished in: Networks (2009)
Keyphrases
- lower bounding
- network design problem
- branch and bound
- branch and bound algorithm
- lower bound
- lower and upper bounds
- lagrangian relaxation
- valid inequalities
- dynamic time warping
- multi step
- approximation algorithms
- upper bound
- network design
- np hard
- similarity search
- mathematical programming
- edit distance
- minimal cost
- optimal solution
- mixed integer programming
- distance computation
- search algorithm
- mixed integer
- transportation networks
- column generation
- euclidean distance
- search space
- objective function
- integer programming
- special case
- lot sizing
- combinatorial optimization
- computationally expensive