A combinatorial study of partial order polytopes

DOI10.1016/S0195-6698(03)00009-XMaRDI QIDQ1867280zbMATH OpenOpenAlexFDO

Authors Samuel Fiorini

Publication date 2 April 2003

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0195-6698(03)00009-x

zbMATH Keywords

linear ordering polytope3-SAT polytopefacial structure of partial order polytopespartial order polytope

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55)

Recommendations

• Polyhedral aspects of partial orders and comparability graphs
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation
• The Order Dimension of Convex Polytopes
• On the partial order polytope of a digraph
• Correlation polytopes: Their geometry and complexity

Cites work

• scientific article; zbMATH DE number 3659595 (Why is no real title available?)
• scientific article; zbMATH DE number 3661361 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 833244 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A note on small linear-ordering polytopes
• All 0-1 polytopes are traveling salesman polytopes
• Determining the automorphism group of the linear ordering polytope
• Facets of linear signed order polytopes.
• Facets of the linear ordering polytope
• Facets of the weak order polytope derived from the induced partition projection
• Hamiltonicity and combinatorial polyhedra
• Induced binary probabilities and the linear ordering polytope: A status report
• Modular decomposition and transitive orientation
• New Facets of the Linear Ordering Polytope
• On the partial order polytope of a digraph
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Set packing relaxations of some integer programs
• Transitive packing

Cited in

(17)

• The common face of some 0/1-polytopes with NP-complete nonadjacency relation
• The Order Dimension of Convex Polytopes
• On affine reducibility of combinatorial polytopes
• Two poset polytopes
• Shortest reconfiguration of perfect matchings via alternating cycles
• Ising formulations of some graph-theoretic problems in psychological research: models and methods
• How to recycle your facets
• scientific article; zbMATH DE number 2188323 (Why is no real title available?)
• Algorithmic aspects of partial convexity
• scientific article; zbMATH DE number 4028291 (Why is no real title available?)
• Orthogonal surfaces. A combinatorial approach
• Polyhedral aspects of partial orders and comparability graphs
• Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
• Primary facets of order polytopes
• On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation
• The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set
• Structural aspects of ordered polymatroids

This page was built for publication: A combinatorial study of partial order polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867280)