scientific article
From MaRDI portal
Publication:3683848
zbMath0567.90026MaRDI QIDQ3683848
Jean-Claude Picard, Maurice Queyranne, Horst W. Hamacher
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items
A note on \(K\) best network flows, The maximum flow problem with disjunctive constraints, Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs, Methods for the one-dimensional space allocation problem, An O(K.n**4) algorithm for finding the K best cuts in a network, On finding the K best cuts in a network
