scientific article; zbMATH DE number 742963
From MaRDI portal
Publication:4763405
zbMath0820.90041MaRDI QIDQ4763405
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (8)
Computing maximum mean cuts ⋮ How to compute least infeasible flows ⋮ Complexity of source-sink monotone 2-parameter min cut ⋮ The quickest flow problem ⋮ Temporal flows in temporal networks ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ Tight bounds on the number of minimum-mean cycle cancellations and related results ⋮ Approximate binary search algorithms for mean cuts and cycles
This page was built for publication:
