Hybrid Procedure Based on Bounded Dynamic Programming and Linear Programming for Solving a Variant of the MMSP-W.
Joaquín Bautista ValhondoAlberto Cano PérezRocío Alfaro PozoCristina Batalla GarcíaPublished in: MIM (2013)
Keyphrases
- linear programming
- dynamic programming
- simplex method
- integer programming problems
- linear programming problems
- markov decision problems
- nonlinear programming
- linear program
- quadratic programming
- interior point algorithm
- feasible solution
- detection mechanism
- mixed integer program
- primal dual
- lp relaxation
- lagrangian relaxation
- quadratic program
- dynamic programming algorithms
- np hard
- optimal solution
- column generation
- integer programming
- knapsack problem
- network flow
- markov decision processes
- integer program
- valid inequalities
- mixed integer
- solving problems
- constraint propagation
- coarse to fine
- nonlinear equations
- np complete
- state space
- genetic algorithm