Pages that link to "Item:Q833530"
From MaRDI portal
The following pages link to A 2-phase algorithm for solving the single allocation \(p\)-hub center problem (Q833530):
Displaying 27 items.
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
- Team formation based on group technology: a hybrid grouping genetic algorithm approach (Q709192) (← links)
- Single-allocation ordered median hub location problems (Q709204) (← links)
- Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
- Aggregation in hub location problems (Q833529) (← links)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
- Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem (Q1683131) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (Q1797769) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← 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 specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← 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)
- Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs (Q2817864) (← links)
- Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU (Q5111122) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- The p-hub centre routing problem with emissions budget: formulation and solution procedure (Q6164586) (← links)