A Lagrangean dual ascent algorithm for simple plant location problems

DOI10.1016/0377-2217(88)90029-XzbMath0696.90025OpenAlexW2082216275MaRDI QIDQ911446

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

zbMATH Keywords

heuristicintegrality gapsplant locationBenders inequalitiesLagrangean dual ascent procedureseparable Lagrangean relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items (20)

Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems ⋮ A hybrid multistart heuristic for the uncapacitated facility location problem ⋮ On the exact solution of large-scale simple plant location problems ⋮ Matheuristics: survey and synthesis ⋮ Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce ⋮ On a class of subadditive duals for the uncapacitated facility location problem ⋮ Lagrangean decomposition: A model yielding stronger lagrangean bounds ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ An application of a Lagrangian-type relaxation for the uncapacitated facility location problem ⋮ Solving the simple plant location problem by genetic algorithm ⋮ A simple filter-and-fan approach to the facility location problem ⋮ A simple tabu search for warehouse location ⋮ Facility location models for distribution system design ⋮ Capacitated facility location problem with general setup cost ⋮ COAL: A new heuristic approach for solving the fixed charge problem - computational results ⋮ Lagrangean heuristics for location problems ⋮ Massively parallel analog tabu search using neural networks applied to simple plant location problems ⋮ An application-oriented guide for designing Lagrangean dual ascent algorithms ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for the solution of the 0-1 knapsack problem
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• 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
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming

This page was built for publication: A Lagrangean dual ascent algorithm for simple plant location problems