### Abstract

Pivoting, i. e. exchanging exactly one element in a basis, is a fundamental step in the simplex algorithm for linear programming. This operation has a combinatorial analogue in matroids and greedoids. In this paper we study pivoting for bases of greedoids. We show that for 2-connected greedoids any basis can be obtained from any other by a (finite) sequence of pivots.

Original language | English |
---|---|

Pages (from-to) | 158-165 |

Number of pages | 8 |

Journal | Mathematical Programming Study |

Issue number | 24 |

Publication status | Published - Oct 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Mathematical Programming Study*, (24), 158-165.

**BASIS GRAPHS OF GREEDOIDS AND TWO-CONNECTIVITY.** / Korte, Bernhard; Lovász, L.

Research output: Contribution to journal › Article

*Mathematical Programming Study*, no. 24, pp. 158-165.

}

TY - JOUR

T1 - BASIS GRAPHS OF GREEDOIDS AND TWO-CONNECTIVITY.

AU - Korte, Bernhard

AU - Lovász, L.

PY - 1985/10

Y1 - 1985/10

N2 - Pivoting, i. e. exchanging exactly one element in a basis, is a fundamental step in the simplex algorithm for linear programming. This operation has a combinatorial analogue in matroids and greedoids. In this paper we study pivoting for bases of greedoids. We show that for 2-connected greedoids any basis can be obtained from any other by a (finite) sequence of pivots.

AB - Pivoting, i. e. exchanging exactly one element in a basis, is a fundamental step in the simplex algorithm for linear programming. This operation has a combinatorial analogue in matroids and greedoids. In this paper we study pivoting for bases of greedoids. We show that for 2-connected greedoids any basis can be obtained from any other by a (finite) sequence of pivots.

UR - http://www.scopus.com/inward/record.url?scp=0022136255&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022136255&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0022136255

SP - 158

EP - 165

JO - Mathematical Programming Study

JF - Mathematical Programming Study

SN - 0303-3929

IS - 24

ER -