Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
From MaRDI portal
Publication:2980928
DOI10.1007/978-3-319-53925-6_31zbMath1485.68313arXiv1612.02990OpenAlexW2566210220MaRDI QIDQ2980928
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.02990
Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Cites Work
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Tight bounds from a path based formulation for the tree of hub location problem
- A study of the quadratic semi-assignment polytope
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- A linear program for the two-hub location problem
- Exact and heuristic approaches for the cycle hub location problem
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- A Monge property for the \(d\)-dimensional transportation problem
- Perspectives of Monge properties in optimization
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Approximation algorithms for classification problems with pairwise relationships
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- The single allocation problem in the interacting three-hub network
- The Hardness of Metric Labeling
- Solving the hub location problem in a star–star network
