The following pages link to Derya Dinler (Q337656):
Displaying 5 items.
- A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
- Heuristics for a continuous multi-facility location problem with demand regions (Q337660) (← links)
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance (Q2158649) (← links)
- A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
- Faster computation of successive bounds on the group betweenness centrality (Q4584868) (← links)
