Cut Dominants and Forbidden Minors

DOI10.1137/15M1010555zbMath1344.05131arXiv1502.07714OpenAlexW2963606478MaRDI QIDQ2818204

Samuel Fiorini, Michele Conforti, Kanstantsin Pashkovich

Publication date: 6 September 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07714

zbMATH Keywords

forbidden minorslinear descriptioncut dominant

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Graph minors (05C83)

Related Items (1)

Regular Matroids Have Polynomial Extension Complexity

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• On the integrality ratio for tree augmentation
• Graph minors. V. Excluding a planar graph
• The traveling salesman problem in graphs with some excluded minors
• On the cut polyhedron.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Traveling salesman path problems
• The traveling salesman problem on a graph and some related integer polyhedra
• Some Results Concerning the Structure of Graphs

This page was built for publication: Cut Dominants and Forbidden Minors