A Lagrangean dual ascent algorithm for simple plant location problems
DOI10.1016/0377-2217(88)90029-XzbMATH Open0696.90025OpenAlexW2082216275MaRDI QIDQ911446FDOQ911446
Authors: Monique Guignard 
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90029-x
Recommendations
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- An application-oriented guide for designing Lagrangean dual ascent algorithms
heuristicintegrality gapsplant locationBenders inequalitiesLagrangean dual ascent procedureseparable Lagrangean relaxation
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Cites Work
- Title not available (Why is that?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Title not available (Why is that?)
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- An algorithm for the solution of the 0-1 knapsack problem
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
Cited In (26)
- A simple filter-and-fan approach to the facility location problem
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Title not available (Why is that?)
- Capacitated facility location problem with general setup cost
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- A hybrid multistart heuristic for the uncapacitated facility location problem
- On the exact solution of large-scale simple plant location problems
- Lagrangian dual ascent by generalized linear programming
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Upper and lower bounds for the two-level simple plant location problem
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Lagrangean heuristics for location problems
- A note on duality gap in the simple plant location problem
- Matheuristics: survey and synthesis
- On a class of subadditive duals for the uncapacitated facility location problem
- Solving the simple plant location problem by genetic algorithm
- Lagrangean relaxation-based techniques for solving facility location problems
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Title not available (Why is that?)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
This page was built for publication: A Lagrangean dual ascent algorithm for simple plant location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911446)
