A polyhedral characterization of the inverse-feasible region of a mixed-integer program.
Jourdain B. LamperskiAndrew J. SchaeferPublished in: Oper. Res. Lett. (2015)
Keyphrases
- mixed integer program
- feasible solution
- convex hull
- linear programming
- tabu search
- lagrangian relaxation
- mixed integer
- objective function
- linear program
- valid inequalities
- lot sizing
- optimal solution
- cutting plane
- mathematical model
- computer vision
- simulated annealing
- search algorithm
- continuous variables
- multistage
- linear programming relaxation