|
|||||
|
|
On the average length of lexicographic paths |
|
| Authors: | M. L. Balinski Th. M. Liebling A. -E. Nobs |
| Affiliation: | (1) Laboratoire d'Econométrie, Ecole Polytechnique, Paris, France;(2) Department of Applied Mathematics and Statistics, SUNY, Stony Brook, NY, USA;(3) Département de Mathématiques, Ecole Polytechnique Féderale de Lausanne, Switzerland |
| 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. |
| Keywords: | Simplex method complexity lexicography polynomial algorithm |
| 本文献已被 SpringerLink 等数据库收录！ | |