Pages that link to "Item:Q2256914"
From MaRDI portal
The following pages link to A simulated annealing-based heuristic for the single allocation maximal covering hub location problem (Q2256914):
Displaying 7 items.
- Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
- Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
- The large-scale dynamic maximal covering location problem (Q2256429) (← links)