scientific article; zbMATH DE number 3828715
From MaRDI portal
Publication:3673577
polyhedralinear inequalitiescombinatorial problemsconvex polyhedronpolyhedral graphtransport polyhedrapermutational polyhedra
Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx) Paths and cycles (05C38) Inequalities and extremum problems involving convexity in convex geometry (52A40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Recommendations
- scientific article; zbMATH DE number 3915102
- Algebraic techniques in graph theory and optimization. Transl. from the Russian
- scientific article; zbMATH DE number 3905351
- Convex Polyhedra
- scientific article; zbMATH DE number 702975
- scientific article; zbMATH DE number 3828714
- Geometry and topology. Transl. from the Russian
- Publication:4890614
- Combinatorics and graph theory. Part I. Transl. from the Russian
Cited in
(58)- The polyhedral-surface cutting plane method of optimization over a vertex-located set
- Determining a matroid polytope by non-Radon partitions
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Permutation polytopes and indecomposable elements in permutation groups
- On the circuit diameter conjecture
- Principal majorization ideals and optimization
- Majorization permutahedra and (0,1)-matrices
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- Convex hulls of orbits of representations of finite groups and combinatorial optimization
- \(N\)-fold integer programming
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- Multidimensional medians arising from geodesics on graphs
- Distributed averaging with linear objective maps
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- All-integer column generation for set partitioning: basic principles and extensions
- Majorization-constrained doubly stochastic matrices
- A survey for the quadratic assignment problem
- Mathematical model for solving operational problem of regional cargo transportation
- Cyclic polytopes and oriented matroids
- On integer programming with bounded determinants
- The k-assignment polytope
- On the vertices of the \(d\)-dimensional Birkhoff polytope
- Column generation in the integral simplex method
- Factorized mutual information maximization.
- Graphs of transportation polytopes
- Continuous extensions on Euclidean combinatorial configurations
- Row-stochastic matrices with a common left fixed vector
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties
- A two-step method for solving vector optimization problems on permutation configuration
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
- Polyhedral combinatorics of multi-index axial transportation problems
- On the Combinatorial Diameters of Parallel and Series Connections
- Fractional perfect \(b\)-matching polytopes. I: General theory
- On the number of faces of certain transportation polytopes
- Matrix majorization
- scientific article; zbMATH DE number 3510328 (Why is no real title available?)
- Simple vertices of maximal minor polytopes
- A note on the approximability of deepest-descent circuit steps
- A characterization of the uncapacitated network design polytope
- Clique facets of the axial and planar assignment polytopes
- Exact and asymptotic results on coarse Ricci curvature of graphs
- Lower bounds for the number of hyperplanes separating two finite sets of points
- Hardness results for multimarginal optimal transport problems
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards
- Projections and angle sums of belt polytopes and permutohedra
- On the extremal points of a class of polytopes of matrices
- Sparse interpolation of symmetric polynomials
- The geometry of products of minors
- Permutohedra and minimal matrices
- Convex integer maximization via Graver bases
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- The hierarchy of circuit diameters and transportation polytopes
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- Lower bounds for contingency tables via Lorentzian polynomials
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters
- Continuous control of chaos
- Transportation matrices with staircase patterns and majorization
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 Q3673577)
