The separable Lagrangean relaxation in the cross decomposition method for the facility location
Conference
·
OSTI ID:35750
We present the {open_quotes}separable Lagrangean relaxation{close_quotes} in the Cross Decomposition Method to solve the Capacitated Facility Location problem with some additional constraints. It is possible to strengthen the dual subproblem adding inequalities, such that the subproblem separates into a Transportation problem and Knapsack problem. We compute the lower bound via ascent steps using {open_quotes}Technique Lagrangean dual ascent{close_quotes}.
- OSTI ID:
- 35750
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Steiner problem in graphs: Lagrangean relaxation and strong valid inequalities
Tight polynominal bounds for matroidal knapsacks
On the Lagrangean duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36244
Tight polynominal bounds for matroidal knapsacks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35762
On the Lagrangean duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36039