Unique lifting of integer variables in minimal inequalities.
Amitabh BasuManoel B. CampêloMichele ConfortiGérard CornuéjolsGiacomo ZambelliPublished in: Math. Program. (2013)
Keyphrases
- integer variables
- branch and bound algorithm
- mixed integer linear programs
- network design problem
- knapsack problem
- objective function
- continuous variables
- mixed integer
- lower bound
- optimal solution
- valid inequalities
- facet defining
- network design
- branch and bound
- integer programming
- facet defining inequalities
- upper bound
- feasible solution
- optimization problems
- greedy algorithm
- cutting plane
- minimal cost
- constraint programming