Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
The authors continue their studies of applying the Lagrangean dual ascent technique [see the first author and \textit{M. B. Rosenwein}, ibid. 43, No.2, 197-205 (1989; Zbl 0682.90066); the first author and \textit{K. Spielberg}, Methods Oper. Res. 57, 131-142 (1987; Zbl 0613.90073)], for bounding a mixed-integer programming problem. In this paper the common scheme is tailored for the capacitated plant location problem (CPLP). Dualization of linking constraints in CPLP induces a decomposition of the Lagrangean relaxed problem (strengthened by valid inequalities) into a transportation problem and a 0-1 knapsack problem. A coordination of parametric analysis between these two problems enables to realize ascent steps yielding an improved bound for CPLP in most cases. Computational experiments are reported based on some very simple ascent steps.
- A Lagrangean dual ascent algorithm for simple plant location problems
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Approximation algorithms for the capacitated plant allocation problem
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A direct dual method for the mixed plant location problem with some side constraints
- A Lagrangean dual ascent algorithm for simple plant location problems
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A search tree algorithm for plant location problems
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Inverse Optimization: An Application to the Capacitated Plant Location Problem
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- Lagrangian dual ascent by generalized linear programming
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- The capacitated distribution and waste disposal problem
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- A multiperiod two-echelon multicommodity capacitated plant location problem
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
- Dynamic supply chain design with inventory
- Bounds for the single source modular capacitated plant location problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
- RAMP experiments in solving the uncapacitated facility location problem
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A Lagrangean dual ascent algorithm for simple plant location problems
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
This page was built for publication: Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640440)
