Uniform capacitated facility location problem with random input data
From MaRDI portal
Recommendations
- A facility location problem with equal amounts of production at random input data
- The capacitated facility location problem with random input data
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
Cites work
- scientific article; zbMATH DE number 3854768 (Why is no real title available?)
- scientific article; zbMATH DE number 4007334 (Why is no real title available?)
- scientific article; zbMATH DE number 3625145 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 742962 (Why is no real title available?)
- scientific article; zbMATH DE number 1855672 (Why is no real title available?)
- A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities
- A strongly polynomial algorithm for the transportation problem
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
Cited in
(3)
This page was built for publication: Uniform capacitated facility location problem with random input data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948657)