2 papers
cs.DM2025
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…
cs.DM2025
Hierarchy of Hub Covering Problems
Niklas Jost
Hub Covering Problems arise in various practical domains, such as urban planning, cargo delivery systems, airline networks, telecommunication network design, and e-mobility. The ta…