A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems.
Renato De LeoneRobert R. MeyerArmand ZakarianPublished in: Comput. Optim. Appl. (1999)
Keyphrases
- relaxation algorithm
- network flow problem
- network design problem
- lagrangian relaxation
- relaxation labeling
- minimum cost
- minimal cost
- network flow
- regularized least squares
- np hard
- mixed integer
- convex hull
- convex optimization
- integer programming
- linear programming
- markov random field
- image sequences
- lower bound
- bayesian networks