 visitante ::
identificación
|
|||||||||||||||
|
Buscar | Enviar | Ayuda | Servicio de Bibliotecas | Sobre el DDD | Català English Español | |||||||||
| Página principal > Artículos > Artículos publicados > Linear programming, the simplex algorithm and simple polytopes |
| Fecha: | 1997 |
| Resumen: | In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. We describe subexponential randomized pivot rules and upper bounds on the diameter of graphs of polytopes. . |
| Derechos: | Tots els drets reservats.  |
| Lengua: | Anglès |
| Documento: | Article ; recerca ; Versió publicada |
| Materia: | Simplex algorithm ; Randomized pivot rule complexity ; Combinatorial theory of simple polytopes |
| Publicado en: | Mathematical Programming, vol. 79 n. 1-3 (1997) p. 217-233, ISSN 0025-5610 |
 Acceso restringido a la UAB |
