Sciweavers

CCO
2001
Springer
157views Combinatorics» more  CCO 2001»
13 years 9 months ago
Lagrangian Relaxation
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
Claude Lemaréchal