An efficient heuristic algorithm for the capacitated p-median problem
From MaRDI portal
Publication:385459
Recommendations
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A bionomic approach to the capacitated \(p\)-median problem
- An effective VNS for the capacitated \(p\)-median problem
- Two exact algorithms for the capacitated p-median problem
- A new method for solving capacitated location problems based on a set partitioning approach
Cites work
- scientific article; zbMATH DE number 53178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194921 (Why is no real title available?)
- scientific article; zbMATH DE number 2215631 (Why is no real title available?)
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A column generation approach to capacitated \(p\)-median problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A fast swap-based local search procedure for location problems
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A genetic algorithm for solving a capacitated \(p\)-median problem
- A scatter search heuristic for the capacitated clustering problem
- An effective VNS for the capacitated \(p\)-median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Clustering search algorithm for the capacitated centered clustering problem
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Heuristic Methods for Location-Allocation Problems
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Local branching
- Metaheuristics. From design to implementation.
- Solution methods for thep-median problem: An annotated bibliography
- The \(p\)-median problem: a survey of metaheuristic approaches
- Tuning an Algorithm Using Design of Experiments
- Two exact algorithms for the capacitated \(p\)-median problem
- Using experimental design to find effective parameter settings for heuristics
Cited in
(18)- A branch‐and‐price algorithm for the capacitated p‐median problem
- An effective VNS for the capacitated \(p\)-median problem
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Two exact algorithms for the capacitated \(p\)-median problem
- scientific article; zbMATH DE number 2215631 (Why is no real title available?)
- A new method for solving capacitated location problems based on a set partitioning approach
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- Matheuristics for the single-path design-balanced service network design problem
- Efficient Algorithms for the Capacitated 1-Median Problem
- A new heuristic approach for the P-median problem
- A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
- A column generation approach to capacitated \(p\)-median problems
- Matheuristics for the capacitated p-Median problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Stochastic capacitated p-median problem with normal distribution; case study: developing the tanks of an oil refinery
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- A dynamic programming heuristic for the \(P\)-median problem
This page was built for publication: An efficient heuristic algorithm for the capacitated \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385459)
