An exact cooperative method for the uncapacitated facility location problem
From MaRDI portal
Publication:495932
DOI10.1007/S12532-014-0065-ZzbMATH Open1327.90094OpenAlexW1976845059MaRDI QIDQ495932FDOQ495932
Authors: Marius Posta, Jacques A. Ferland, Philippe Michelon 
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
Recommendations
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- A method for solving to optimality uncapacitated location problems
- A Dual-Based Add Heuristic for Uncapacitated Facility Location
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- scientific article; zbMATH DE number 1560330
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Smooth minimization of non-smooth functions
- On the exact solution of large-scale simple plant location problems
- Neighborhood search heuristics for the uncapacitated facility location problem
- Lagrangean heuristics for location problems
- Solving the uncapacitated facility location problem using tabu search
- Solving the simple plant location problem by genetic algorithm
- Title not available (Why is that?)
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- A simple tabu search for warehouse location
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Space/time trade-offs in hash coding with allowable errors
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Title not available (Why is that?)
- The volume algorithm: Producing primal solutions with a subgradient method
- The simple plant location problem: Survey and synthesis
- Approximation Algorithms for Metric Facility Location Problems
- An aggressive reduction scheme for the simple plant location problem
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Title not available (Why is that?)
- A projection method for the uncapacitated facility location problem
- 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
- A note on duality gap in the simple plant location problem
- Solving the simple plant location problem using a data correcting approach
- Branch and peg algorithms for the simple plant location problem.
- Fast bounding procedures for large instances of the simple plant location problem
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
- Title not available (Why is that?)
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
- A method for solving to optimality uncapacitated location problems
Cited In (9)
- Revisiting Lagrangian relaxation for network design
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- New valid inequalities and facets for the simple plant location problem
- Matheuristics: survey and synthesis
- A Lagrangian search method for the \(P\)-median problem
- A separation algorithm for the simple plant location problem
- On a class of subadditive duals 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
Uses Software
This page was built for publication: An exact cooperative method 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 Q495932)
