Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm.
Massimo CaboaraJohn PerryPublished in: Appl. Algebra Eng. Commun. Comput. (2014)
Keyphrases
- computational complexity
- linear program
- memory requirements
- linear programming
- dynamic programming
- space complexity
- learning algorithm
- optimal solution
- simplex method
- optimization algorithm
- worst case
- numerically stable
- mixed integer linear program
- lower bound
- primal dual
- objective function
- strongly polynomial
- randomly generated
- convergence rate
- search space
- packing problem
- mathematical model
- np hard