unsplittable flow
Description: A network optimization problem in which each demand must be routed along a single path rather than divided among multiple paths.
Primary topic: Complexity and Algorithms in Graphs (54%)
OpenAlex ID: keywords/unsplittable-flow
