scientific article; zbMATH DE number 3294139
From MaRDI portal
Publication:5576685
Cited in
(42)- Graphs of transportation polytopes
- Degeneracy in transportation problems
- Permanental polytopes of doubly stochastic matrices
- Designing two factor experiments for selecting interactions
- Perron eigenvectors and the symmetric transportation polytope
- Row-stochastic matrices with a common left fixed vector
- A proof of Fulkerson's characterization of permutation matrices
- The geometry of products of minors
- The Ehrhart polynomial of the Birkhoff polytope
- On the number of faces of certain transportation polytopes
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- The hierarchy of circuit diameters and transportation polytopes
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- Limit laws for empirical optimal solutions in random linear programs
- The extreme points of centrosymmetric transportation polytopes
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- A geometric study of cores of idempotent stochastic matrices
- Fractional perfect \(b\)-matching polytopes. I: General theory
- Transportation polytopes
- Polytopes de transport symétriques
- Towards the geometry of double Hurwitz numbers
- Information-geometric equivalence of transportation polytopes
- Circuit walks in integral polyhedra
- On the diameter of cut polytopes
- Distributed averaging with linear objective maps
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- Algunas variantes del problema de la duracion variable
- Ad hoc heuristic for the cover printing problem
- Extreme points of certain transportation polytopes with fixed total sums
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Symmetric and Hankel-symmetric transportation polytopes
- The polytope of Tesler matrices
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Constructing Clustering Transformations
- Plethysm and lattice point counting
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Couplings and matchings: combinatorial notes on Strassen's theorem
- Restricted Birkhoff polytopes and Ehrhart period collapse
- Support of extremal doubly stochastic arrays
- On the uniqueness of Kantorovich potentials
- \(N\)-fold integer programming
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 Q5576685)