Distances between optimal solutions of mixed-integer programs.
Joseph PaatRobert WeismantelStefan WeltgePublished in: Math. Program. (2020)
Keyphrases
- mixed integer program
- feasible solution
- optimal solution
- mixed integer
- linear program
- linear programming
- lagrangian relaxation
- objective function
- tabu search
- np hard
- lower bound
- lot sizing
- branch and bound algorithm
- cutting plane
- mathematical model
- valid inequalities
- branch and bound
- column generation
- metaheuristic
- simulated annealing
- knapsack problem
- linear programming relaxation
- dynamic programming
- mixed integer programming
- computer vision