Valid Inequalities for Separable Concave Constraints with Indicator Variables.
Cong Han LimJeff T. LinderothJames R. LuedtkePublished in: IPCO (2016)
Keyphrases
- valid inequalities
- binary variables
- mixed integer
- continuous variables
- integer programming
- lower and upper bounds
- traveling salesman problem
- linear programming
- mixed integer programming
- feasible solution
- cutting plane
- cutting plane algorithm
- integer program
- mixed integer linear programs
- convex hull
- network design problem
- column generation
- objective function
- mixed integer program
- linear programming relaxation
- linear program
- integer variables
- primal dual
- lagrangian relaxation
- combinatorial optimization
- np hard
- soft constraints
- dynamic systems
- knapsack problem
- upper bound
- bayesian networks
- constraint programming
- facet defining inequalities