scientific article; zbMATH DE number 3290885

Cited in

(41)

Nowhere-zero integral flows on a bidirected graph
The incidence structure of subspaces with well-scaled frames
Edge-packings of graphs and network reliability
A generalization of Robacker's theorem
Polyhedra of regular p-nary group problems
Subspaces with well-scaled frames
A submodular approach to discrete dynamic programming
Algebraic flows in regular matroids
Matroids and multicommodity flows
Optimal cocircuits in regular matroids and applications
The ellipsoid method and its consequences in combinatorial optimization
On the computational behavior of a polynomial-time network flow algorithm
Tight integral duality gap in the Chinese postman problem
A composition for matroids
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
Consistency, redundancy, and implied equalities in linear systems
Generalizing the all-pairs min cut problem
The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
On the composition and decomposition of clutters
A boolean theory of network flows and metrics and its applications to particle transmission and clustering
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
The Null Space Problem I. Complexity
Dual row modules and polyhedra of blocking group problems
Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks
Quasi-balanced matrices
A “from scratch” proof of a theorem of Rockafellar and Fulkerson
Maximizing the minimum source-sink path subject to a budget constraint
scientific article; zbMATH DE number 3298861 (Why is no real title available?)
Blocking and anti-blocking pairs of polyhedra
An update-and-stabilize framework for the minimum-norm-point problem
An update-and-stabilize framework for the minimum-norm-point problem
A first order method for linear programming parameterized by circuit imbalance
Packing and covering of crossing families of cuts
A unified interpretation of several combinatorial dualities

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572841)