A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs.
Christos KoufogiannakisNeal E. YoungPublished in: Algorithmica (2014)
Keyphrases
- linear program
- linear programming
- semi infinite
- simplex method
- optimal solution
- np hard
- approximation algorithms
- multistage stochastic
- column generation
- primal dual
- stochastic programming
- worst case
- interior point methods
- dynamic programming
- approximation schemes
- objective function
- extreme points
- integer program
- linear inequalities
- nelder mead
- simplex algorithm
- interior point
- linear programming problems
- mixed integer
- strongly polynomial
- quadratic program
- polynomial time approximation
- evolutionary algorithm
- learning algorithm
- mixed integer linear program
- market equilibrium
- machine learning