Tight integral duality gap in the Chinese Postman problem.
Ephraim KorachMichal PennPublished in: Math. Program. (1992)
Keyphrases
- duality gap
- augmented lagrangian
- primal dual
- lower bound
- exact penalty
- set covering problem
- convex programming
- upper bound
- optimality conditions
- inequality constraints
- worst case
- optimal solution
- linear program
- linear programming
- constrained optimization
- total variation
- convex optimization
- interior point methods
- set covering
- optimization algorithm
- np hard
- dual formulation