Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion.
Amir Ahmadi-JavidPooya HoseinpourPublished in: CoRR (2017)
Keyphrases
- mixed integer
- continuous variables
- continuous relaxation
- discrete variables
- linear program
- mixed integer programming
- benders decomposition
- lot sizing
- cutting plane
- optimal solution
- feasible solution
- convex hull
- lagrangian heuristic
- facility location
- linear programming relaxation
- convex optimization
- interior point methods
- network design problem
- valid inequalities
- dynamic systems
- quadratic program
- quadratic programming
- higher dimensional
- structure learning
- finite number
- mathematical model
- linear programming
- np hard