Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. On the average length of lexicographic paths
 
research article

On the average length of lexicographic paths

Balinski, M.
•
Liebling, Th. M.  
•
Nobs, A.
1986
Mathematical Programming

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
  • Metrics
Type
research article
DOI
10.1007/BF01580885
Author(s)
Balinski, M.
Liebling, Th. M.  
Nobs, A.
Date Issued

1986

Published in
Mathematical Programming
Issue

35

Start page

362

End page

364

Note

PRO 86.01

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
ROSO  
Available on Infoscience
February 13, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/222498
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés