Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Letter to the Editor—A Note on the Branch-and-Bound Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs and Ramseyian Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on a Problem of Moser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Extreme Points / rank
 
Normal rank

Latest revision as of 12:17, 12 June 2024

scientific article
Language Label Description Also known as
English
Edmonds polytopes and a hierarchy of combinatorial problems
scientific article

    Statements

    Edmonds polytopes and a hierarchy of combinatorial problems (English)
    0 references
    0 references
    1973
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references