Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)

DOI10.1016/J.DISC.2006.03.009MaRDI QIDQ2497988zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.03.009

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A characterization of perfect graphs
• Anti-blocking polyhedra
• Edmonds polytopes and weakly hamiltonian graphs
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3393943 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• Hypergraphs and Ramseyian Theorems
• Integral Extreme Points
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• Maximum matching and a polyhedron with 0,1-vertices
• Minimum partition of a matroid into independent subsets
• Normal hypergraphs and the perfect graph conjecture
• On certain polytopes associated with graphs
• Outline of an algorithm for integer solutions to linear programs
• Paths, Trees, and Flowers
• Remarks on a Problem of Moser
• Some remarks on the theory of graphs
• The complexity of theorem-proving procedures
• The Factorization of Linear Graphs

Cited in

(7)

• Tight rank lower bounds for the Sherali-Adams proof system
• Caps and progression-free sets in \(\mathbb{Z}_m^n\)
• A computational complexity comparative study of graph tessellation problems
• The Complexity of Propositional Proofs
• Optimal length cutting plane refutations of integer programs
• Proving the infeasibility of Horn formulas through read-once resolution
• Optimal length cutting plane refutations of integer programs

This page was built for publication: Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)

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