1 citations · 1 across the 4 of their papers we have counts for
4 papers
Why Districting Becomes NP-hard
Niklas Jost, Adolfo Escobedo, Alice Kirchheim
This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming…
Approximation guarantees for Hub Covering Problems
Niklas Jost, Florian Jaehn
Hub Covering Problems are a subclass of Hub Location Problems. The objective is to select a set of hubs that enable paths between given origin-destination delivery tasks, while min…
An Approximation Algorithm for Multi Allocation Hub Location Problems
Niklas Jost
The multi allocation p-hub median problem (MApHM), the multi allocation uncapacitated hub location problem (MAuHLP) and the multi allocation p-hub location problem (MApHLP) are com…
Partitioned vs. Integrated Planning of Hinterland Networks for LCL Transportation
Niklas Jost, Dorothee Henke, Ivo Hedtke +4
Utilizing existing transportation networks better and designing (parts of) networks involves routing decisions to minimize transportation costs and maximize consolidation effects.…