Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks
From MaRDI portal
Publication:2757586
DOI10.1287/moor.24.1.106zbMath0977.90004OpenAlexW2152399246MaRDI QIDQ2757586
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.24.1.106
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Related Items (3)
Resource downgrading ⋮ Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming ⋮ The most likely path on series-parallel networks
This page was built for publication: Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks
