One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
From MaRDI portal
Publication:1273088
DOI10.1016/S0167-6377(98)00009-1zbMath0911.90155OpenAlexW2087182500WikidataQ126439114 ScholiaQ126439114MaRDI QIDQ1273088
Bettina Klinz, Gerhard J. Woeginger
Publication date: 6 December 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00009-1
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (4)
Flows in strongly regular periodic dynamic resource networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Temporal flows in temporal networks ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of dynamic network flows
- Computing the throughput of a network with dedicated lines
- Minimum Convex Cost Dynamic Network Flows
- The quickest flow problem
- Minimum cost dynamic flows: The series-parallel case
- Constructing Maximal Dynamic Flows from Static Flows
This page was built for publication: One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
