Abstract
Seymour's conjecture on binary clutters with the so-called weak (or Q+-) max-flow min-cut property implies - if true - a wide variety of results in combinatorial optimization about objects ranging from matchings to (multicommodity) flows and disjoint paths. In this paper we review in particular the relation between classes of multicommodity flow problems for which the so-called cut-condition is sufficient and classes of polyhedra for which Seymour's
conjecture is true.
| Original language | English |
|---|---|
| Pages (from-to) | 281- |
| Journal | CWI Quarterly |
| Volume | 6 |
| Issue number | 3 |
| Publication status | Published - 1993 |