Steiner diagrams and \(k\)-star hubs
From MaRDI portal
Publication:2466026
DOI10.1016/j.jda.2006.06.001zbMath1149.90020OpenAlexW2163322390MaRDI QIDQ2466026
Peter Oertel, Ulrich Blasum, Winfried Hochstättler, Gerhard J. Woeginger
Publication date: 11 January 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.06.001
Trees (05C05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locational analysis
- The Steiner tree problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Planning models for long-haul operations of postal and express shipment companies
- Routing problems: A bibliography
- The Vehicle Routing Problem
- Steiner problem in networks: A survey
- The Complexity of Multiterminal Cuts
- A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows
- The General Pickup and Delivery Problem
- Approximation Algorithms for Directed Steiner Problems
- Reducibility among Combinatorial Problems
This page was built for publication: Steiner diagrams and \(k\)-star hubs