Packing circuits in matroids

DOI10.1007/s10107-007-0205-6zbMath1188.90176OpenAlexW2120346144MaRDI QIDQ1013971

Wenan Zang, Guoli Ding

Publication date: 24 April 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0205-6

zbMATH Keywords

polyhedrontraveling salesman problemmatroidcircuittotal dual integrality

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

The box-TDI system associated with 2-edge connected spanning subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem in graphs with some excluded minors
• On two minimax theorems in graph
• Packing odd circuits in Eulerian graphs
• Clutters with \(\tau_ 2 \Relbar 2\tau\)
• A characterization of box \(\frac 1d\)-integral binary clutters
• The 2-edge-connected subgraph polyhedron
• The traveling salesman problem on a graph and some related integer polyhedra

This page was built for publication: Packing circuits in matroids