Pages that link to "Item:Q1652521"
From MaRDI portal
The following pages link to Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521):
Displaying 14 items.
- Hub location under competition (Q322435) (← links)
- Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
- Annealing algorithms for multisource absolute location problems on graph (Q1356068) (← links)
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- Nature inspired meta-heuristic algorithms for solving the load-balancing problem in cloud environments (Q2002862) (← links)
- Alternate solution approaches for competitive hub location problems (Q2029306) (← 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)
- Environmental impact analysis of hub-and-spoke network operation (Q2187991) (← links)
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem (Q2256914) (← links)
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952) (← links)
- A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand (Q2664382) (← links)
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing (Q4320083) (← links)
