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

DOI10.1016/J.AMC.2014.10.072MaRDI QIDQ902981zbMATH OpenOpenAlexFDO

Authors 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

exact methodsinteger programmingsubadditive dualuncapacitated facility location problemvariable fixing

Mathematics Subject Classification ID

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

Recommendations

• A Dual-Based Add Heuristic for Uncapacitated Facility Location
• Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
• Subadditive approaches in integer programming

Cites work

• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• 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
• A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
• A practical algorithm for computing a subadditive dual function for set partitioning
• Algorithms for facility location problems with outliers. (Extended abstract)
• An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
• An aggressive reduction scheme for the simple plant location problem
• An exact cooperative method for the uncapacitated facility location problem
• Branch and peg algorithms for the simple plant location problem
• Duality for mixed-integer linear programs
• Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
• Fast bounding procedures for large instances of the simple plant location problem
• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 3664742 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3568354 (Why is no real title available?)
• scientific article; zbMATH DE number 3578640 (Why is no real title available?)
• scientific article; zbMATH DE number 2086935 (Why is no real title available?)
• scientific article; zbMATH DE number 3378707 (Why is no real title available?)
• scientific article; zbMATH DE number 956792 (Why is no real title available?)
• Integer Programming: Methods, Uses, Computations
• Lagrangean heuristics for location problems
• On the exact solution of large-scale simple plant location problems
• Primal-dual variable neighborhood search for the simple plant-location problem
• Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
• Solving the p-median problem with a semi-Lagrangian relaxation
• Subadditive approaches in integer programming
• The simple plant location problem: Survey and synthesis
• Uncapacitated and capacitated facility location problems

Cited in

(3)

• A practical algorithm for computing a subadditive dual function for set partitioning
• Subadditive approaches in integer programming
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902981)