One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
type: Item
instance of: scholarly article
title: One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
zbMATH Open document ID: 0911.90155
DOI: 10.1016/S0167-6377(98)00009-1
author: Bettina Klinz
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 1998-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1229529
zbMATH Keywords: dynamic network
zbMATH Keywords: directed graph
zbMATH Keywords: dedicated arcs
zbMATH Keywords: NP-hard
zbMATH Keywords: maximum flow
MaRDI profile type: Publication
cites work: A survey of dynamic network flows
cites work: The quickest flow problem
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Q4198056
cites work: Q3128904
cites work: Q4886085
cites work: Minimum cost dynamic flows: The series-parallel case
cites work: Computing the throughput of a network with dedicated lines
cites work: Minimum Convex Cost Dynamic Network Flows
cites work: Q5687194
Wikidata QID: Q126439114
full work available at URL: s0167-6377(98)00009-1
OpenAlex ID: W2087182500
description: scientific article; zbMATH DE number 1229529