The strongest facets of the acyclic subgraph polytope are unknown (Q4645939): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet Generating Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum cardinality of a consistent set of arcs in a random tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Consistent Arcs in a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced binary probabilities and the linear ordering polytope: A status report / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary but insufficient condition for the stochastic binary choice problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case comparison of valid inequalities for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: More facets from fences for linear ordering and acyclic subgraph polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal ranking of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric and combinatorial properties of the polytope of binary choice probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Latest revision as of 19:57, 17 July 2024

scientific article; zbMATH DE number 7000365
Language Label Description Also known as
English
The strongest facets of the acyclic subgraph polytope are unknown
scientific article; zbMATH DE number 7000365

    Statements

    The strongest facets of the acyclic subgraph polytope are unknown (English)
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    valid inequality
    0 references
    primitive root
    0 references
    quadratic residue
    0 references
    linear order problem
    0 references
    rank inequality
    0 references

    Identifiers