The interval order polytope of a digraph

DOI10.1007/3-540-59408-6_41zbMath1498.05117OpenAlexW1579527683MaRDI QIDQ5101405

Andreas S. Schulz, Rudolf Müller

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_41

zbMATH Keywords

linear ordering polytopeMöbius ladder inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Extended formulations for order polytopes through network flows ⋮ Transitive packing ⋮ Determining the automorphism group of the linear ordering polytope ⋮ Primary facets of order polytopes

Cites Work

• Facets of the clique partitioning polytope
• More facets from fences for linear ordering and acyclic subgraph polytopes
• On the complexity of DNA physical mapping
• On certain polytopes associated with graphs
• A necessary but insufficient condition for the stochastic binary choice problem
• The partition problem
• Facets of the linear ordering polytope
• Complexity and algorithms for reasoning about time
• Graph Sandwich Problems
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The interval order polytope of a digraph