On a class of subadditive duals for the uncapacitated facility location problem

DOI10.1016/j.amc.2014.10.072zbMath1328.90077OpenAlexW1985732029MaRDI QIDQ902981

Ehsan Monabbati, Hossein Taghizadeh Kakhki

Publication date: 4 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.072

zbMATH Keywords

integer programmingexact methodsvariable fixinguncapacitated facility location problemsubadditive dual

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A practical algorithm for computing a subadditive dual function for set partitioning
• 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
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
• Subadditive approaches in integer programming
• 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
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
• Integer Programming: Methods, Uses, Computations
• Uncapacitated and Capacitated Facility Location Problems

This page was built for publication: On a class of subadditive duals for the uncapacitated facility location problem