An evolutionary algorithm for the capacitated p-median problem
From MaRDI portal
Cites work
- A bionomic approach to the capacitated \(p\)-median problem
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A column generation approach to capacitated p-median problems
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A genetic algorithm for solving a capacitated \(p\)-median problem
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- A new method for solving capacitated location problems based on a set partitioning approach
- A scatter search heuristic for the capacitated clustering problem
- An adaptive tabu search algorithm for the capacitated clustering problem
- An effective VNS for the capacitated \(p\)-median problem
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Efficient algorithms for the capacitated concentrator location problem
- Exact methods and a variable neighborhood search for the robust capacitated p-median problem
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2215631 (Why is no real title available?)
- Hybrid genetic algorithms with selective crossover for the capacitated p-Median problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Innovations in hybrid intelligent systems. Selected papers based on the presentations at the 2nd international workshop on hybrid artificial intelligence systems, (HAIS 2007), Salamance, Spain, November 2007
- Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation
- Matheuristics for the capacitated p-Median problem
- Model-based capacitated clustering with posterior regularization
- Solving capacitated clustering problems
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
This page was built for publication: An evolutionary 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 Q7404494)
