 visitante ::
identificación
|
|||||||||||||||
|
Buscar | Enviar | Ayuda | Servicio de Bibliotecas | Sobre el DDD | Català English Español | |||||||||
| Página principal > Artículos > Artículos publicados > A new strongly polynomial dual network simplex algorithm |
| Fecha: | 1997 |
| Resumen: | This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos' (1993) dual network simplex algorithm by a factor of m/n. . |
| Derechos: | Tots els drets reservats.  |
| Lengua: | Anglès |
| Documento: | Article ; recerca ; Versió publicada |
| Materia: | Dual simplex algorithm ; Minimum cost network flow problem ; Network simplex algorithm |
| Publicado en: | Mathematical Programming, vol. 78 n. 2 (1997) p. 131-148, ISSN 0025-5610 |
 Acceso restringido a la UAB |
