A combinatorial study of partial order polytopes

DOI10.1016/S0195-6698(03)00009-XzbMATH Open1020.52010OpenAlexW2077831283MaRDI QIDQ1867280FDOQ1867280

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55)

Cites Work

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

Cited In (17)

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

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)