Faster Algorithms for the Generalized Network Flow Problem
From MaRDI portal
Publication:2757524
DOI10.1287/moor.23.1.69zbMath0977.90003OpenAlexW2071840115MaRDI QIDQ2757524
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.23.1.69
network optimizationgeneralized circulationnetwork problemapproximate optimality conditionsgeneralized flow
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (10)
Improving time bounds on maximum generalised flow computations by contracting the network ⋮ A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Robust flows with losses and improvability in evacuation planning ⋮ The price of anarchy in series-parallel network congestion games ⋮ Temporal flows in temporal networks ⋮ Multi-commodity flow problem on lossy network with partial lane reversals ⋮ Generalized max flow in series-parallel graphs ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Maximum network flows with concave gains
This page was built for publication: Faster Algorithms for the Generalized Network Flow Problem
