scientific article
From MaRDI portal
Publication:3840368
zbMath0911.90156MaRDI QIDQ3840368
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
preflow-push algorithmfat-path capacity-scaling algorithmgain-scaling techniquegeneralized maximum flow problempolynomial-time combinatorial algorithmsTruemper's algorithm
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items (4)
Improving time bounds on maximum generalised flow computations by contracting the network ⋮ A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Generalized max flow in series-parallel graphs ⋮ Maximum flow problem in wireless ad hoc networks with directional antennas
This page was built for publication:
