A Dynamic Programming Solution to the Monotonic Path of Minimal Cost in a 3-Rows Matrix.
Marcelo CicconetDavi GeigerPublished in: CoRR (2013)
Keyphrases
- minimal cost
- dynamic programming
- network flow problem
- feasible solution
- endpoints
- network design problem
- optimal solution
- lagrangian relaxation
- linear equations
- greedy algorithm
- combinational optimization
- solution path
- coefficient matrix
- network flow
- exact solution
- linear programming
- mathematical model
- state space
- locally optimal
- search algorithm
- objective function
- image processing
- learning algorithm