scientific article; zbMATH DE number 3828714
From MaRDI portal
Publication:3673576
combinatorial problemsconvex polyhedronlinear inequalitiespermutational polyhedrapolyhedrapolyhedral graphtransport polyhedra
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Recommendations
- scientific article; zbMATH DE number 863499
- Polyhedral Combinatorics in Combinatorial Optimization
- scientific article; zbMATH DE number 665699
- scientific article; zbMATH DE number 4187465
- Convex Polytopes
- scientific article; zbMATH DE number 24443
- scientific article; zbMATH DE number 3970526
- scientific article; zbMATH DE number 1241854
- Polyhedral techniques in combinatorial optimization I: Theory
Cited in
(40)- A new proof of a theorem of Harper on the Sperner-Erdős problem
- Optimal representations of partially ordered sets and a limit Sperner theorem
- Development of hypergraph theory
- Convex polyhedra of distributions preserved by operations over a finite field
- On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Conditions of solvability of vector problems using linear convolution of criteria
- Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
- Numerical assessment of the informational influence of election campaigns on the electorate
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations
- The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
- FPT-algorithm for computing the width of a simplex given by a convex hull
- Special transpositions of permutation elements and properties of their composition
- Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
- The solution polyhedron of the dissipative inequality for relaxation SISO systems
- Influence of certain transpositions on the cyclic structure of permutations
- Multidimensional triangle-truncated simplexes
- On the polytope faces of the graph approximation problem
- Hyperbolic Coxeter n-polytopes with n+3 facets
- scientific article; zbMATH DE number 3828715 (Why is no real title available?)
- Multiindex transportation problems with 2-embedded structure
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
- scientific article; zbMATH DE number 6964098 (Why is no real title available?)
- Parallelohedra defined by quadratic forms
- Symmetric Polyhedra with Rhombic Vertices
- On multi-symmetric functions and transportation polytopes
- Continuous representations and functional extensions in combinatorial optimization
- Multi-index transportation problems with 1-nested structure
- Convex polyhedra with deltoidal vertices
- scientific article; zbMATH DE number 7310045 (Why is no real title available?)
- scientific article; zbMATH DE number 7092020 (Why is no real title available?)
- On facet-inducing inequalities for combinatorial polytopes
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem
- Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem
- On the enumeration of convex \(RR\)-polyhedra
- The method of artificial space dilation in problems of optimal packing of geometric objects
- A special case of resolving polynomials
- On a problem of integer optimization
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 Q3673576)
