Nonunique Lifting of Integer Variables in Minimal Inequalities.
Amitabh BasuSantanu S. DeyJoseph PaatPublished in: SIAM J. Discret. Math. (2019)
Keyphrases
- integer variables
- branch and bound algorithm
- mixed integer linear programs
- network design problem
- mixed integer
- knapsack problem
- objective function
- continuous variables
- valid inequalities
- branch and bound
- lower bound
- facet defining
- optimal solution
- facet defining inequalities
- np hard
- feasible solution
- traveling salesman problem
- network design
- mixed integer programming
- linear programming
- upper bound
- linear program
- complex systems
- random variables
- transportation networks
- optimization problems
- scheduling problem