2995. On the complexity of Price-collecting Hub Location Problems
Invited abstract in session HC-51: Hub Network Design, stream Hub Location and Network Design.
Thursday, 10:30-12:00Room: HG – Seminar-Raum Geschichte 1 (1st floor, st. 10)
Authors (first author is the speaker)
| 1. | Nele Pommerening
|
| Institute of Transport Logistics, TU Dortmund University | |
| 2. | Christoph Buchheim
|
| Fakultät für Mathematik, Technische Universität Dortmund |
Abstract
We study the complexity of price-collecting variants of the well-known hub-location problem, in part with vehicle based costs. Due to the complexity of classical hub location problems, most of the variants are also NP-hard. So we also investigate variants when the hubs and the allocations are given in advance. It is interesting to see, that here the complexity differs depending on how the costs for the transport arise. The problem with linear costs lies in P, while some variants with vehicle based costs are NP-hard in the strong sense.
Keywords
- Logistics
- Transportation
- Location and Routing
Status: accepted
Back to the list of papers