Two-phase greedy algorithms for some classes of combinatorial linear programs.
Ulrich FaigleBritta PeisPublished in: ACM Trans. Algorithms (2010)
Keyphrases
- linear program
- greedy algorithms
- greedy algorithm
- linear programming
- simplex method
- objective function
- dynamic programming
- semi infinite
- optimal solution
- stochastic programming
- primal dual
- np hard
- knapsack problem
- column generation
- interior point methods
- linear programming problems
- extreme points
- mixed integer
- mixed integer linear program
- market equilibrium
- multistage stochastic
- semidefinite programming
- linear inequalities
- integer program
- simplex algorithm
- convex functions
- optimization problems
- nelder mead
- inventory routing