Pages that link to "Item:Q689257"
From MaRDI portal
The following pages link to A clustering approach to the planar hub location problem (Q689257):
Displaying 12 items.
- A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
- Graph clustering (Q458448) (← links)
- The \(K\)-connection location problem in a plane (Q816418) (← links)
- New complexity results for the \(p\)-hub median problem (Q829182) (← links)
- An exact solution procedure for a cluster hub location problem (Q859914) (← links)
- A hybrid genetic/optimization algorithm for a task allocation problem (Q1297698) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
- On tabu search for the location of interacting hub facilities (Q1328642) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Extensions to the Weber problem (Q2147049) (← links)
- The planar hub location problem: a probabilistic clustering approach (Q2449351) (← links)
- Network hub location problems: The state of the art (Q2482813) (← links)
