Flow metrics
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(4)
This page was built for publication: Flow metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044352)