The strongest facets of the acyclic subgraph polytope are unknown

DOI10.1007/3-540-61310-2_31MaRDI QIDQ4645939zbMATH OpenOpenAlexFDO

Authors Michel X. Goemans, Leslie A. Hall

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

linear order problemprimitive rootquadratic residuerank inequalityvalid inequality

Mathematics Subject Classification ID

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

Recommendations

• On the acyclic subgraph polytope
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Facets of the linear ordering polytope
• scientific article; zbMATH DE number 1263289
• Generating facets for the independence system polytope

Cites work

• A Minimax Theorem for Directed Graphs
• A necessary but insufficient condition for the stochastic binary choice problem
• Facet generating techniques
• Facets of the linear ordering polytope
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• scientific article; zbMATH DE number 3888925 (Why is no real title available?)
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Induced binary probabilities and the linear ordering polytope: A status report
• Matching theory
• More facets from fences for linear ordering and acyclic subgraph polytopes
• On Sets of Consistent Arcs in a Tournament
• On the acyclic subgraph polytope
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Optimal ranking of tournaments
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Worst-case comparison of valid inequalities for the TSP

Cited in

(8)

• Properties of some ILP formulations of a class of partitioning problems
• Clutter nonidealness
• How to recycle your facets
• On the acyclic subgraph polytope
• Bayesian network learning via topological order
• Determining the automorphism group of the linear ordering polytope
• Small bipartite subgraph polytopes
• Primary facets of order polytopes

Describes a project that uses

Uses Software

• LOLIB

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

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