An exact cooperative method for the uncapacitated facility location problem
From MaRDI portal
Publication:495932
DOI10.1007/s12532-014-0065-zzbMath1327.90094OpenAlexW1976845059MaRDI QIDQ495932
Marius Posta, Philippe Yves Paul Michelon, Jacques A. Ferland
Publication date: 16 September 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0065-z
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Derivative-free methods and methods using generalized derivatives (90C56) Discrete location and assignment (90B80)
Related Items
A Lagrangian search method for the \(P\)-median problem, Revisiting Lagrangian relaxation for network design, Matheuristics: survey and synthesis, On a class of subadditive duals for the uncapacitated facility location problem, New valid inequalities and facets for the simple plant 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, A separation algorithm for the simple plant location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- A simple tabu search for warehouse location
- 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
- A projection method for the uncapacitated facility location problem
- A method for solving to optimality uncapacitated location problems
- On the exact solution of large-scale simple plant location problems
- Neighborhood search heuristics for the uncapacitated facility location problem
- Solving the simple plant location problem using a data correcting approach
- Branch and peg algorithms for the simple plant location problem.
- The volume algorithm: Producing primal solutions with a subgradient method
- Fast bounding procedures for large instances of the simple plant location problem
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Solving the uncapacitated facility location problem using tabu search
- An aggressive reduction scheme for the simple plant location problem
- Solving the simple plant location problem by genetic algorithm
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Approximation Algorithms for Metric Facility Location Problems
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
- Space/time trade-offs in hash coding with allowable errors
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
