An exact cooperative method for the uncapacitated facility location problem
From MaRDI portal
(Redirected from Publication:495932)
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
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 1175956 (Why is no real title available?)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A method for solving to optimality uncapacitated location problems
- A note on duality gap in the simple plant location problem
- A projection method for the uncapacitated facility location problem
- A simple tabu search for warehouse location
- An aggressive reduction scheme for the simple plant location problem
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximation Algorithms for Metric Facility Location Problems
- Branch and peg algorithms for the simple plant location problem.
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- Fast bounding procedures for large instances of the simple plant location problem
- Lagrangean heuristics for location problems
- Neighborhood search heuristics for the uncapacitated facility location problem
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
- 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
- Smooth minimization of non-smooth functions
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Solving the simple plant location problem by genetic algorithm
- Solving the simple plant location problem using a data correcting approach
- Solving the uncapacitated facility location problem using tabu search
- Space/time trade-offs in hash coding with allowable errors
- The simple plant location problem: Survey and synthesis
- The volume algorithm: Producing primal solutions with a subgradient method
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
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)
