An improved Lagrangian relaxation and dual ascent approach to facility location problems
From MaRDI portal
Publication:1789574
DOI10.1007/s10287-015-0244-zzbMath1397.90239OpenAlexW2195430740MaRDI QIDQ1789574
Andreas Klose, Kurt O. Jørnsten
Publication date: 10 October 2018
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-015-0244-z
Lagrangian relaxationmixed integer programmingfacility locationuncapacitated facility location problemsemi-Lagrangian relaxation
Mixed integer programming (90C11) Discrete location and assignment (90B80) Numerical methods of relaxation type (49M20)
Related Items
Revisiting Lagrangian relaxation for network design, Matheuristics: survey and synthesis, Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce, Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems, An exact and a heuristic approach for the transportation-\(p\)-facility location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- An exact cooperative method for the uncapacitated facility location problem
- A cutting plane algorithm for the capacitated facility location problem
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Computational study of large-scale \(p\)-median problems
- An effective heuristic for large-scale capacitated facility location problems
- A comparison of two dual-based procedures for solving the p-median problem
- On the exact solution of large-scale simple plant location problems
- A tree search algorithm for the p-median problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- The volume algorithm: Producing primal solutions with a subgradient method
- Fast bounding procedures for large instances of the simple plant location problem
- Near-optimal solutions to large-scale facility location problems
- The simple plant location problem: Survey and synthesis
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- A tighter formulation of the \(p\)-median problem
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- An aggressive reduction scheme for the simple plant location problem
- Solving the simple plant location problem by genetic algorithm
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A Minimal Algorithm for the 0-1 Knapsack Problem
- On constrained optimization by adjoint based quasi-Newton methods
- Uncapacitated and Capacitated Facility Location Problems
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
