Pages that link to "Item:Q2487738"
From MaRDI portal
The following pages link to Algorithms of ant system and simulated annealing for the \(p\)-median problem (Q2487738):
Displaying 13 items.
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Confidence in heuristic solutions? (Q746822) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- Ant algorithms: theory and applications (Q2432976) (← links)
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)
- Pharmacy duty scheduling problem (Q2811939) (← links)
- Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
- Affinity propagation and uncapacitated facility location problems (Q5964469) (← links)