scientific article; zbMATH DE number 3580570

Cited in

(only showing first 100 items - show all)

The box-TDI system associated with 2-edge connected spanning subgraphs
Packing circuits in matroids
Rooted \(k\)-connections in digraphs
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Short proofs on the matching polyhedron
Testing membership in matroid polyhedra
Some sequences associated with combinatorial structures
An integer analogue of Carathéodory's theorem
A strongly polynomial minimum cost circulation algorithm
Linear and combinatorial sharing problems
Polyhedral proof methods in combinatorial optimization
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
An out-of-kilter method for submodular flows
Greedoid polyhedra
An application of simultaneous diophantine approximation in combinatorial optimization
Directed cut transversal packing for source-sink connected graphs
Generalized polymatroids and submodular flows
Directed submodularity, ditroids and directed submodular flows
An application of submodular flows
Polyhedra related to undirected multicommodity flows
A counterexample to a conjecture of Edmonds and Giles
Discrete extremal problems
On total dual integrality
Minimization on submodular flows
Total dual integrality and b-matchings
The ellipsoid method and its consequences in combinatorial optimization
Using separation algorithms to generate mixed integer model reformulations
Color constrained combinatorial optimization problems
A dual algorithm for submodular flow problems
A weighted min-max relation for intervals
On a composition of independence systems by circuit identification
Negative circuits for flows and submodular flows
Coflow polyhedra
Lattice matrices, intersection of ring families and dicuts
Solution of two fractional packing problems of Lovász
Note on inverse problem with l_ objective function
The nucleon of cooperative games and an algorithm for matching games
A primal dual integer programming algorithm
Minimum cost multiflows in undirected networks
How to tidy up a symmetric set-system by use of uncrossing operations
A capacity scaling algorithm for convex cost submodular flows
Optimum partitioning into intersections of ring families
Packing cycles in graphs
Cutting planes from a mixed integer Farkas lemma.
Graph covers using \(t\)-colourable vertex sets.
Inverse problems of submodular functions on digraphs
Totally tight Chvatal-Gomory cuts
Randomized algorithms for finding the shortest negative cost cycle in networks
Total dual integrality of the linear complementarity problem
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
Greedy oriented flows
Inheritance of convexity for partition restricted games
\(M\)-convex functions and tree metrics
Coordinatewise domain scaling algorithm for M-convex function minimization
A capacity scaling algorithm for M-convex submodular flow
Total dual integrality and integral solutions of the linear complementarity problem
Gainfree Leontief substitution flow problems
Matchings and covers in hypergraphs
A decomposition of the matroids with the max-flow min-cut property
On totally dual integral systems
Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
Operations that preserve total dual integrality
Polyhedral structure of submodular and posi-modular systems
A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
Submodular linear programs on forests
Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
Simple push-relabel algorithms for matroids and submodular flows
Lattice polyhedra and submodular flows
Min-cost multiflows in node-capacitated undirected networks
A note on polylinking flow networks
Affine and projective tree metric theorems
Cuboids, a class of clutters
Ranking tournaments with no errors. II: Minimax relation
A new infinite class of ideal minimally non-packing clutters
Complexity of packing common bases in matroids
The Schrijver system of the flow cone in series-parallel graphs
Integer plane multiflow maximisation: one-quarter-approximation and gaps
Submodular function minimization and polarity
On some algorithmic aspects of hypergraphic matroids
Idealness of \(k\)-wise intersecting families
Finding popular branchings in vertex-weighted digraphs
Total dual dyadicness and dyadic generating sets
Fair integral submodular flows
Theorems of the alternative for conic integer programming
The \(b\)-branching problem in digraphs
The max-flow min-cut property and \(\pm 1\)-resistant sets
Computation and efficiency of potential function minimizers of combinatorial congestion games
Dijkstra's algorithm and L-concave function maximization
Abstract flows over time: a first step towards solving dynamic packing problems
Max-multiflow/min-multicut for G+H series-parallel
On the Galois lattice of bipartite distance hereditary graphs
Separation of partition inequalities with terminals
Trader multiflow and box-TDI systems in series-parallel graphs
An algorithmic approach to dual integrality of matching and extensions
Balanced matrices
The maximum vertex coverage problem on bipartite graphs
Degree bounded matroids and submodular flows
Tree-compositions and orientations

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 Q4149476)