scientific article; zbMATH DE number 3290885
From MaRDI portal
Publication:5572841
zbMath0182.53402MaRDI QIDQ5572841
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, The incidence structure of subspaces with well-scaled frames, Edge-packings of graphs and network reliability, Generalizing the all-pairs min cut problem, A generalization of Robacker's theorem, A boolean theory of network flows and metrics and its applications to particle transmission and clustering, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, The Null Space Problem I. Complexity, Polyhedra of regular p-nary group problems, Subspaces with well-scaled frames, Consistency, redundancy, and implied equalities in linear systems, A submodular approach to discrete dynamic programming, Algebraic flows in regular matroids, An update-and-stabilize framework for the minimum-norm-point problem, Dual row modules and polyhedra of blocking group problems, Blocking and anti-blocking pairs of polyhedra, Quasi-balanced matrices, A “from scratch” proof of a theorem of Rockafellar and Fulkerson, Matroids and multicommodity flows, Optimal cocircuits in regular matroids and applications, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, The ellipsoid method and its consequences in combinatorial optimization, Unnamed Item, On the computational behavior of a polynomial-time network flow algorithm, A unified interpretation of several combinatorial dualities, Tight integral duality gap in the Chinese postman problem, A composition for matroids, Maximizing the minimum source-sink path subject to a budget constraint, On the length-width inequality for compound clutters, Chords and disjoint paths in matroids, Matroids, generalized networks, and electric network synthesis, Orientability of matroids, A combinatorial abstraction of linear programming, The matroids with the max-flow min-cut property, Quelques théoremes de dualité combinatoire, On removing a vertex from the assignment polytope, On the composition and decomposition of clutters, Packing and covering of crossing families of cuts, Nowhere-zero integral flows on a bidirected graph
