An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
From MaRDI portal
Publication:2257610
DOI10.1007/s13160-014-0149-1zbMath1307.90111OpenAlexW2084322099MaRDI QIDQ2257610
Publication date: 25 February 2015
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-014-0149-1
Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Discrete location and assignment (90B80)
Related Items (4)
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 improved Lagrangian relaxation and dual ascent approach to facility location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- An exact cooperative method for the uncapacitated facility location problem
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A Lagrangean dual ascent algorithm for simple plant location problems
- A method for solving to optimality uncapacitated location problems
- On the exact solution of large-scale simple plant location problems
- Fast bounding procedures for large instances of the simple plant location problem
- Branch and peg algorithms for the simple plant location problem
- Lagrangean heuristics for location problems
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- The simple plant location problem: Survey and synthesis
- Lagrangean relaxation. (With comments and rejoinder).
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- An aggressive reduction scheme for the simple plant location problem
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Some relationships between lagrangian and surrogate duality in integer programming
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Linear Programming
- A large-scale application of the partial coverage uncapacitated facility location problem
- Integer Programming: Methods, Uses, Computations
- Uncapacitated and Capacitated Facility Location Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
This page was built for publication: An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
