New Valid Inequalities for the Optimal Communication Spanning Tree Problem.
Yogesh Kumar AgarwalPrahalad VenkateshanPublished in: INFORMS J. Comput. (2019)
Keyphrases
- valid inequalities
- cutting plane algorithm
- mixed integer linear programs
- integer programming
- traveling salesman problem
- mixed integer programming
- mixed integer
- dynamic programming
- cutting plane
- column generation
- lower and upper bounds
- convex hull
- integer program
- communication networks
- feasible solution
- network design problem
- optimal solution