BASIS GRAPHS OF GREEDOIDS AND TWO-CONNECTIVITY.

Bernhard Korte, L. Lovász

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 languageEnglish
Pages (from-to)158-165
Number of pages8
JournalMathematical Programming Study
Issue number24
Publication statusPublished - Oct 1985

Fingerprint

Linear programming

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

In: Mathematical Programming Study, No. 24, 10.1985, p. 158-165.

Research output: Contribution to journalArticle

@article{bb428fb004f0482897b2a1e73f25b5f4,
title = "BASIS GRAPHS OF GREEDOIDS AND TWO-CONNECTIVITY.",
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.",
author = "Bernhard Korte and L. Lov{\'a}sz",
year = "1985",
month = "10",
language = "English",
pages = "158--165",
journal = "Mathematical Programming Study",
issn = "0303-3929",
number = "24",

}

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

SP - 158

EP - 165

JO - Mathematical Programming Study

JF - Mathematical Programming Study

SN - 0303-3929

IS - 24

ER -