Pages that link to "Item:Q1683131"
From MaRDI portal
The following pages link to A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131):
Displayed 9 items.
- Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← 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)
- The hub location problem with market selection (Q2027000) (← links)
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems (Q2056575) (← links)
- Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← links)
- An efficient model for the multiple allocation hub maximal covering problem (Q6078427) (← links)
- A parallel adaptive memory algorithm for the capacitated modular hub location problem (Q6164373) (← links)