A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies.
Sabyasachi MitraIshwar MurthyPublished in: INFORMS J. Comput. (1998)
Keyphrases
- network topologies
- valid inequalities
- primal dual
- network topology
- integer programming
- linear programming
- cutting plane algorithm
- mixed integer programming
- lower and upper bounds
- traveling salesman problem
- mixed integer
- network design problem
- cutting plane
- facet defining
- column generation
- feasible solution
- convex hull
- linear programming relaxation
- continuous variables
- linear program
- approximation algorithms
- integer program
- np hard
- computational complexity
- search algorithm
- convex optimization
- lagrangian relaxation
- branch and bound
- data streams