LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program.
Daniel PrusaTomás WernerPublished in: IEEE Trans. Pattern Anal. Mach. Intell. (2017)
Keyphrases
- linear program
- lp relaxation
- linear programming
- optimal solution
- integer program
- column generation
- primal dual
- np hard
- message passing
- interior point methods
- graph cuts
- integer programming formulation
- integrality gap
- dynamic programming
- interior point
- mixed integer
- objective function
- markov random field
- image segmentation
- integer solution
- knapsack problem
- feasible solution
- multi label
- multistage
- evolutionary algorithm
- pairwise