Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.
Michele ConfortiMarianna De SantisMarco Di SummaFrancesco RinaldiPublished in: 4OR (2021)
Keyphrases
- cutting plane algorithm
- integer programming
- integer points
- valid inequalities
- cutting plane
- integer variables
- network design problem
- convex hull
- linear constraints
- lagrangian relaxation
- production planning
- np hard
- linear programming
- column generation
- linear svm
- constraint programming
- maximum margin
- network flow
- integer program
- vehicle routing problem with time windows
- objective function
- convex sets
- mixed integer
- linear model
- simulated annealing
- upper bound
- lower bound
- feature space
- learning algorithm