Pages that link to "Item:Q526421"
From MaRDI portal
The following pages link to General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421):
Displaying 21 items.
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q1687628) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
- Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
- Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems (Q2056575) (← links)
- An efficient heuristic for a hub location routing problem (Q2070128) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- A non-triangular hub location problem (Q2191284) (← links)
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities (Q2222085) (← links)
- Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey (Q2691459) (← links)
- Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
- A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale (Q6047905) (← links)
- The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
- The p-hub centre routing problem with emissions budget: formulation and solution procedure (Q6164586) (← links)