Characterization of facets of the hop constrained chain polytope via dynamic programming.
Martin GrötschelRüdiger StephanPublished in: Discret. Appl. Math. (2014)
Keyphrases
- dynamic programming
- facet defining inequalities
- knapsack problem
- linear programming
- lattice points
- facet defining
- greedy algorithm
- stable set
- state space
- stereo matching
- convex hull
- single machine
- semidefinite
- coarse to fine
- optimal policy
- reinforcement learning
- lagrangian relaxation
- locally optimal
- constrained problems
- database
- multiresolution