scientific article
From MaRDI portal
zbMath0458.90021MaRDI QIDQ3908745
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items
A fast cost scaling algorithm for submodular flow, An out-of-kilter method for submodular flows, Uncertain minimum cost flow problem, 0/1-Integer programming: Optimization and Augmentation are equivalent, Minimum-cost flows in unit-capacity networks, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, Minimal-cost network flow problems with variable lower bounds on arc flows, A new scaling algorithm for the minimum cost network flow problem, About the minimum mean cycle-canceling algorithm, On the computational behavior of a polynomial-time network flow algorithm, Polynomial-time primal simplex algorithms for the minimum cost network flow problem, Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, A faster polynomial algorithm for the constrained maximum flow problem, Non-standard approaches to integer programming, A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
