Cited in
(only showing first 100 items - show all)- Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
- Efficiency in decentralized oligopolistic markets
- Systems of representatives
- On double-resolution imaging and discrete tomography
- Existence and constructions of connected block designs with given vectors of treatment replications and block sizes
- Reformulating linear programs with transportation constraints-With applications to workforce scheduling
- Invariant Sets for Classes of Matrices of Zeros and Ones
- Inequalities and existence theorems in the theory of matrices
- The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
- Interval stochastic matrices: A combinatorial lemma and the computation of invariant measures of dynamical systems
- Optimization and reconstruction of hv-convex (0,1)-matrices
- The bipartite-splittance of a bipartite graph
- Degree sequences and majorization
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- On an inequality of A. Khintchine for zero-one matrices
- An evolutionary algorithm for discrete tomography
- On assignment functions
- Rounding in symmetric matrices and undirected graphs
- Biproportional scaling of matrices and the iterative proportional fitting procedure
- Witt vectors. I
- scientific article; zbMATH DE number 4081605 (Why is no real title available?)
- Graphs with given valences
- On matching numbers of tree and bipartite degree sequences
- Sampling binary contingency tables with a greedy start
- On extremal multiflows
- The class of matrices of zeros, ones, and twos with prescribed row and column sums
- Dynamic discrete tomography
- On the little secondary Bruhat order
- Dually vertex-oblique graphs
- New linearizations of quadratic assignment problems
- On the existence of sequences and matrices with prescribed partial sums of elements
- A strongly polynomial algorithm for line search in submodular polyhedra
- A majorization theorem for the C-matrices of binary designs
- On the eigenvalues of the structure matrix of matrices of zeros and ones
- Arranging apples in an array
- On the number of zero-patterns of a sequence of polynomials
- scientific article; zbMATH DE number 4016924 (Why is no real title available?)
- An introduction to periodical discrete sets from a tomographical perspective
- Latin squares and their Bruhat order
- Reconstruction of Convex Sets from One or Two X-rays
- An experimental study of the stability problem in discrete tomography
- On Ryser's maximum term rank formula
- Constrained flow control in storage networks: capacity maximization and balancing
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Über reguläre Kettengruppen
- The class A(R,S) of (0,1)-matrices
- Triangular (0,1)-matrices with prescribed row and column sums
- Linear-time certifying algorithms for near-graphical sequences
- Bipartite regulation numbers
- Constructing (0,1)-matrices with large minimal defining sets
- On normal matrices of zeros and ones with fixed row sum
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- On the spectral structure of monic matrix polynomials and the extension problem
- A network flow algorithm for reconstructing binary images from discrete X-rays
- Balanced home-away assignments
- Blocking pairs of polyhedra arising from network flows
- Exact embedding of two \(G\)-designs into a \((G+e)\)-design
- A survey of dynamic network flows
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
- On the degrees of the vertices of a directed graph
- A catalog of steiner tree formulations
- A canonical construction for nonnegative integral matrices with given line sums
- A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
- The Grone-Merris conjecture
- Single-commodity robust network design with finite and hose demand sets
- Bayesian persuasion: reduced form approach
- Matrices of zeros and ones with fixed row and column sum vectors
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- On the realization of a (p,s)-digraph with prescribed degrees
- Majorization permutahedra and (0,1)-matrices
- Sets of uniqueness and minimal matrices
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- Pairs of sequences with a unique realization by bipartite graphs
- Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
- Term rank of \(0,1\) matrices
- Random graphs with a given degree sequence
- Certificates of optimality: the third way to biproportional apportionment
- Degree sequences and edge connectivity
- A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs
- Consistency, redundancy, and implied equalities in linear systems
- Constructive extensions of two results on graphic sequences
- Generic iterative subset algorithms for discrete tomography
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Complexity and algorithms for nonlinear optimization problems
- Maximum-Minimum Sätze über Graphen
- Constructing integral matrices with given line sums
- Exact sampling and counting for fixed-margin matrices
- The probabilistic serial mechanism with private endowments
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
- Matrices of zeros and ones with given line sums and a zero block
- A note on the characterization of digraphic sequences
- Bidimensional allocation of seats via zero-one matrices with given line sums
- On (0, 1)-matrices with prescribed row and column sum vectors
- Integral matrices with given row and column sums
- A network simplex method
This page was built for publication: A theorem on flows in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q770930)
