Valid Inequalities for Problems with Additive Variable Upper Bounds.
Alper AtamtürkGeorge L. NemhauserMartin W. P. SavelsberghPublished in: IPCO (1999)
Keyphrases
- upper bound
- lower and upper bounds
- valid inequalities
- lower bound
- network design problem
- integer programming problems
- randomly generated problems
- cutting plane
- traveling salesman problem
- np complete
- mixed integer programming
- linear programming
- continuous variables
- optimization problems
- cutting plane algorithm
- high dimensional
- learning algorithm