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

DOI10.1016/j.disc.2006.03.009zbMath1106.05070OpenAlexW4248887642WikidataQ59699139 ScholiaQ59699139MaRDI QIDQ2497988

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

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

Related Items (5)

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

Cites Work

• On certain polytopes associated with graphs
• Anti-blocking polyhedra
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Outline of an algorithm for integer solutions to linear programs
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Integral Extreme Points
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• Minimum partition of a matroid into independent subsets
• Remarks on a Problem of Moser
• The complexity of theorem-proving procedures
• Hypergraphs and Ramseyian Theorems
• Edmonds polytopes and weakly hamiltonian graphs
• The Factorization of Linear Graphs
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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