Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints.
Cunjing GeArmin BierePublished in: CP (2024)
Keyphrases
- linear constraints
- mixed integer
- quadratic program
- feasible solution
- binary variables
- linear program
- mixed integer programming
- linear programming relaxation
- convex hull
- nonlinear programming
- lot sizing
- upper bound
- valid inequalities
- cutting plane
- optimal solution
- lower bound
- convex sets
- continuous variables
- linear programming problems
- lower and upper bounds
- convex optimization
- tabu search
- linear programming
- search algorithm
- objective function