Pages that link to "Item:Q1826490"
From MaRDI portal
The following pages link to A hybrid heuristic for the \(p\)-median problem (Q1826490):
Displaying 18 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
- A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
- Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
- Randomized heuristics for the family traveling salesperson problem (Q4979987) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- A sample approximation solution procedure for chance-constrained districting problems (Q6068707) (← links)
- Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
- Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)
- An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
