Pages that link to "Item:Q596685"
From MaRDI portal
The following pages link to A genetic algorithm for solving a capacitated \(p\)-median problem (Q596685):
Displaying 14 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Application of global optimization methods to model and feature selection (Q437761) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover (Q1683144) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model (Q2654319) (← links)
