| Regular matroids have been studied from the moment combinatorial optimization emerged. They are abstractions of graphs that capture some essential properties of flows and potentials in graphs. Whittle has defined several natural generalizations of regular matroids. We wish to study these new classes of matroids and gain an understanding that parallels our current knowledge of regular matroids |
