A mixed integer formulation for maximal covering by inclined parallelograms.
Hassan YouniesGeorge O. WesolowskyPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- mixed integer
- lot sizing
- linear program
- mixed integer programming
- valid inequalities
- optimal solution
- benders decomposition
- cutting plane
- convex hull
- feasible solution
- mixed integer program
- quadratic program
- continuous relaxation
- network design problem
- second order cone program
- continuous variables
- mixed integer linear programming
- lagrangian heuristic
- learning algorithm
- maximum likelihood
- multistage
- dynamic programming