A Lagrangean dual ascent algorithm for simple plant location problems
From MaRDI portal
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
Cites work
- A Dual-Based Procedure for Uncapacitated Facility Location
- 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
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
Cited in
(29)- 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
- Upper and lower bounds for the two-level simple plant location problem
- Lagrangean heuristics for location problems
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
- A simple filter-and-fan approach to the facility location problem
- Capacitated facility location problem with general setup cost
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- Solving the simple plant location problem by genetic algorithm
- scientific article; zbMATH DE number 1823835 (Why is no real title available?)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- scientific article; zbMATH DE number 3993306 (Why is no real title available?)
- A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
- Lagrangean relaxation-based techniques for solving facility location problems
- Matheuristics: survey and synthesis
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- A note on duality gap in the simple plant location problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- On a class of subadditive duals for the uncapacitated facility location problem
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)
