On Lifting Integer Variables in Minimal Inequalities.
Amitabh BasuManoel B. CampêloMichele ConfortiGérard CornuéjolsGiacomo ZambelliPublished in: IPCO (2010)
Keyphrases
- integer variables
- branch and bound algorithm
- mixed integer linear programs
- network design problem
- knapsack problem
- objective function
- mixed integer
- continuous variables
- branch and bound
- feasible solution
- network design
- optimal solution
- dynamic programming
- upper bound
- np hard
- mixed integer programming
- lower bound
- facet defining inequalities
- bayesian networks
- facet defining