Pages that link to "Item:Q1026110"
From MaRDI portal
The following pages link to Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110):
Displayed 10 items.
- Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- Approximation algorithms for median hub location problems (Q2424817) (← links)
- Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center (Q6109001) (← links)
- A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)