Packing circuits in matroids

DOI10.1007/S10107-007-0205-6MaRDI QIDQ1013971zbMATH OpenOpenAlexFDO

Authors Guoli Ding, Wenan Zang

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 problemcircuitmatroidtotal dual integrality

Mathematics Subject Classification ID

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

Recommendations

• Matroid packing and covering with circuits through an element
• Packing circuits in eulerian digraphs
• Packing cycles in graphs
• Labeled packing of cycles and circuits
• scientific article; zbMATH DE number 3954941
• Packing odd circuits in Eulerian graphs
• Packings in complete graphs
• On packing minors into connected matroids
• Matroid-Based Packing of Arborescences
• Matroids Induced by Packing Subgraphs

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• A characterization of box \(\frac 1d\)-integral binary clutters
• Clutters with \(\tau_ 2 \Relbar 2\tau\)
• On two minimax theorems in graph
• Packing odd circuits in Eulerian graphs
• The 2-edge-connected subgraph polyhedron
• The traveling salesman problem in graphs with some excluded minors
• The traveling salesman problem on a graph and some related integer polyhedra

Cited in

(14)

• The positive circuits of oriented matroids with the packing property or idealness
• scientific article; zbMATH DE number 3954941 (Why is no real title available?)
• Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
• The box-TDI system associated with 2-edge connected spanning subgraphs
• scientific article; zbMATH DE number 475604 (Why is no real title available?)
• Packing circuits into \(K_N\).
• A short proof of a min-max relation for the bases packing of a matroid
• Optimal packing of even circuits into a \(\text{DK}_ v\)
• Packing Odd Circuits
• scientific article; zbMATH DE number 1743772 (Why is no real title available?)
• On packing minors into connected matroids
• Matroid packing and covering with circuits through an element
• Packing of (0, 1)-matrices
• Complexity of packing common bases in matroids

This page was built for publication: Packing circuits in matroids

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