The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs.
Yi-Jun ChangZeyong LiPublished in: PODC (2023)
Keyphrases
- linear program
- linear programming
- extreme points
- optimal solution
- semi infinite
- stage stochastic programs
- simplex method
- convex functions
- stochastic programming
- np hard
- objective function
- dynamic programming
- primal dual
- interior point methods
- linear inequalities
- column generation
- feasible solution
- worst case
- market equilibrium
- mixed integer linear program
- linear programming problems
- mixed integer
- interior point
- computational complexity
- nelder mead
- integer programming
- simulated annealing
- integer program
- special case
- geometric properties
- packing problem