Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
Massimo CaboaraJohn PerryPublished in: CoRR (2012)
Keyphrases
- linear program
- computational complexity
- linear programming
- memory requirements
- dynamic programming
- space complexity
- objective function
- primal dual
- strongly polynomial
- optimal solution
- simplex method
- optimization algorithm
- learning algorithm
- np hard
- search space
- mixed integer linear program
- randomly generated
- extreme points
- stochastic programming
- linear programming problems
- column generation
- nelder mead