Nearly Linear-Time Approximation Schemes for Mixed Packing/Covering and Facility-Location Linear Programs.
Neal E. YoungPublished in: CoRR (2014)
Keyphrases
- facility location
- linear program
- approximation schemes
- mixed integer
- linear programming
- approximation algorithms
- integer programming
- np hard
- lagrangian relaxation
- column generation
- packing problem
- worst case
- optimal solution
- simplex method
- network design
- objective function
- primal dual
- dynamic programming
- cutting plane
- bin packing
- numerical methods
- integer program
- lower bound
- multi criteria
- feasible solution
- metaheuristic
- extreme points
- genetic algorithm
- partial differential equations
- convex hull
- decision makers