Abstract
A bound is given for the average length of a "lexicographic path", a definition that is motivated by degeneracies encountered when using the randomized simplex method.
Details
Title
On the average length of lexicographic paths
Author(s)
Balinski, M. ; Liebling, Th. M. ; Nobs, A.
Published in
Mathematical Programming
Issue
35
Pages
362-364
Date
1986
Note
PRO 86.01
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-02-13