The strongest facets of the acyclic subgraph polytope are unknown

DOI10.1007/3-540-61310-2_31zbMath1415.90135OpenAlexW1870929205MaRDI QIDQ4645939

Leslie A. Hall, Michel X. Goemans

Publication date: 11 January 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_31

zbMATH Keywords

primitive rootquadratic residuevalid inequalityrank inequalitylinear order problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (7)

Small bipartite subgraph polytopes ⋮ Clutter nonidealness ⋮ Determining the automorphism group of the linear ordering polytope ⋮ How to recycle your facets ⋮ Primary facets of order polytopes ⋮ Properties of some ILP formulations of a class of partitioning problems ⋮ Unnamed Item

Uses Software

• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Matching theory
• Induced binary probabilities and the linear ordering polytope: A status report
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• More facets from fences for linear ordering and acyclic subgraph polytopes
• A necessary but insufficient condition for the stochastic binary choice problem
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Worst-case comparison of valid inequalities for the TSP
• Facet Generating Techniques
• On the acyclic subgraph polytope
• Facets of the linear ordering polytope
• A Minimax Theorem for Directed Graphs
• On Sets of Consistent Arcs in a Tournament
• Optimal ranking of tournaments

This page was built for publication: The strongest facets of the acyclic subgraph polytope are unknown