Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

DOI10.1007/s10589-010-9338-2zbMath1244.90168OpenAlexW2010909841MaRDI QIDQ434153

Cesar Beltran-Royo, Jean-Philippe Vial, Antonio Alonso-Ayuso

Publication date: 10 July 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10115/5814

zbMATH Keywords

Lagrangian relaxationmixed integer programminguncapacitated facility location (UFL) problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items

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, On a class of subadditive duals for the uncapacitated facility location problem, The spherical constraint in Boolean quadratic programs, An exact cooperative method for the uncapacitated facility location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An aggressive reduction scheme for the simple plant location problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• A note on duality gap in the simple plant location problem
• A hybrid multistart heuristic for the uncapacitated facility location problem
• Computational study of large-scale \(p\)-median problems
• A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
• A Lagrangean dual ascent algorithm for simple plant location problems
• A projection method for the uncapacitated facility location problem
• On the exact solution of large-scale simple plant location problems
• Uncapacitated facility location: General solution procedure and computational experience
• A parallel interior point method and its application to facility location problems
• Neighborhood search heuristics for the uncapacitated facility location problem
• Near-optimal solutions to large-scale facility location problems
• On the facets of the simple plant location packing polytope
• Lagrangean relaxation. (With comments and rejoinder).
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
• Solving the uncapacitated facility location problem using tabu search
• New facets for the two-stage uncapacitated facility location polytope
• The Cutting-Plane Method for Solving Convex Programs
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• On constrained optimization by adjoint based quasi-Newton methods
• The Optimal Diversity Management Problem