Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts.
Christoph NeumannOliver SteinPublished in: SIAM J. Optim. (2021)
Keyphrases
- mixed integer
- feasible solution
- convex optimization problems
- convex hull
- convex optimization
- linear program
- linear programming
- lot sizing
- primal dual
- facility location
- extreme points
- interior point methods
- learning problems
- continuous variables
- tabu search
- optimization problems
- optimal solution
- objective function
- training data
- reinforcement learning
- decision trees
- metaheuristic
- data points