A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program.
Yi-Shuai NiuYu YouPublished in: CoRR (2021)
Keyphrases
- linear program
- cutting plane algorithm
- convex functions
- column generation
- linear programming
- cutting plane
- dual variables
- mixed integer
- valid inequalities
- integer programming
- convex programming
- integer program
- max flow
- primal dual
- interior point methods
- optimal solution
- np hard
- maximum margin
- linear programming problems
- objective function
- convex optimization
- quadratic program
- dynamic programming
- lagrangian relaxation
- mixed integer programming
- vehicle routing problem with time windows
- lagrangian dual
- linear svm
- interior point
- network flow
- routing problem
- convex optimization problems
- feasible solution