scientific article; zbMATH DE number 3156381

Cited in

(67)

Some sequences associated with combinatorial structures
A system of linear equations related to the transportation problem with application to probability theory
Generalized polymatroids and submodular flows
Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions
Total unimodularity and combinatorial theorems
Matroids and multicommodity flows
Optimal cocircuits in regular matroids and applications
Matching theory -- a sampler: From Dénes König to the present
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Approximate binary search algorithms for mean cuts and cycles
The facets of the polyhedral set determined by the Gale-Hoffman inequalities
Computing maximum mean cuts
On \(k\)-strong and \(k\)-cyclic digraphs
How to compute least infeasible flows
Consistency, redundancy, and implied equalities in linear systems
Flows, view obstructions, and the lonely runner
Packing spanning trees in highly essentially connected graphs
A flow based pruning scheme for enumerative equitable coloring algorithms
A polynomial time algorithm for the minimum flow problem in time-varying networks
The flow index and strongly connected orientations
Complexity of minimum irreducible infeasible subsystem covers for flow networks
An analogue of Hoffman's circulation conditions for max-balanced flows
Polynomials associated with nowhere-zero flows
The time dependent traveling salesman problem: polyhedra and algorithm
Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
Decreasing minimization on M-convex sets: algorithms and applications
Metric and ultrametric inequalities for directed graphs
Comparison of formulations for the inventory routing problem
Circular zero-sum r-flows of regular graphs
Balanced flows for transshipment problems
Fractional matching preclusion number of graphs and the perfect matching polytope
Inequalities and existence theorems in the theory of matrices
Unimodular modules
Complexity and algorithms for nonlinear optimization problems
A new approach for computing a most positive cut using the minimum flow algorithms
Compact formulations of the Steiner traveling salesman problem and related problems
Colouring series-parallel graphs
A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
Basic Terminology, Notation and Results
Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Matrices of zeros and ones
On the subdifferential of a submodular function
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
Rao's degree sequence conjecture
Flows and parity subgraphs of graphs with large odd-edge-connectivity
The flow circulation sharing problem
Matching, Euler tours and the Chinese postman
A privacy-preserving method to optimize distributed resource allocation
What the transportation problem did for me
Balanced matrices
Systems of representatives
Possible line sums for a qualitative matrix
Cycle selections
Spanning eulerian subdigraphs in semicomplete digraphs
Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups
Frobenius-König theorem for classes of (0, 1)-matrices
Circular flow on signed graphs
An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
Prefix-bounded matrices
Proportionality in multiple dimensions to design electoral systems
Integral infeasibility and testing total dual integrality
Financial systems: A few theoretical and algebraic considerations for their modeling
Finding feasible vectors of Edmonds-Giles polyhedra
The travelling preacher, projection, and a lower bound for the stability number of a graph
A new algorithm for solving the feasibility problem of a network flow

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