Packing circuits in matroids

Packing circuits in matroids

The purpose of this paper is to characterize all matroids M that satisfy the following minimax relation: for any nonnegative integral weight function w defined on E ( M ), Our characterization contains a complete solution to a research problem on 2-edge-connected subgraph polyhedra posed by Cornuéjo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming 2009-06, Vol.119 (1), p.137-168
Hauptverfasser: Ding, Guoli, Zang, Wenan
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Calculus of Variations and Optimal Control
Optimization
Circuits
Combinatorics
Equality
Exact sciences and technology
Flows in networks. Combinatorial problems
Full Length Paper
Graphs
Linear programming
Logistics
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematical programming
Mathematics
Mathematics and Statistics
Mathematics of Computing
Numerical Analysis
Operational research and scientific management
Operational research. Management science
Theoretical
Traveling salesman problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The purpose of this paper is to characterize all matroids M that satisfy the following minimax relation: for any nonnegative integral weight function w defined on E ( M ), Our characterization contains a complete solution to a research problem on 2-edge-connected subgraph polyhedra posed by Cornuéjols, Fonlupt, and Naddef in 1985, which was independently solved by Vandenbussche and Nemhauser in Vandenbussche and Nemhauser (J. Comb. Optim. 9:357–379, 2005).
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-007-0205-6