Fast bounding procedures for large instances of the simple plant location problem
From MaRDI portal
Recommendations
Cites work
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- A Dual-Based Procedure for Dynamic Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A note on duality gap in the simple plant location problem
- A projection method for the uncapacitated facility location problem
- An algorithm for solving large capacitated warehouse location problems
- An implementation of the simplex method for linear programming problems with variable upper bounds
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation Algorithms for Metric Facility Location Problems
- Branch and peg algorithms for the simple plant location problem.
- 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?)
- scientific article; zbMATH DE number 2079337 (Why is no real title available?)
- scientific article; zbMATH DE number 3378707 (Why is no real title available?)
- Lagrangean heuristics for location problems
- On the exact solution of large-scale simple plant location problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Primal-dual variable neighborhood search for the simple plant-location problem
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- 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
- The simple plant location problem: Survey and synthesis
Cited in
(15)- On the exact solution of large-scale simple plant location problems
- Upper and lower bounds for the two-level simple plant location problem
- Branch and peg algorithms for the simple plant location problem.
- Branch and peg algorithms for the simple plant location problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- An aggressive reduction scheme for the simple plant location problem
- Approximation Algorithms for Generalized Plant Location
- scientific article; zbMATH DE number 1823835 (Why is no real title available?)
- scientific article; zbMATH DE number 4010185 (Why is no real title available?)
- Bounding methods for facilities location algorithms
- An exact cooperative method for the uncapacitated facility location problem
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Matheuristics: survey and synthesis
- On a class of subadditive duals for the uncapacitated facility location problem
This page was built for publication: Fast bounding procedures for large instances of the simple plant location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762067)
