Combinatorial properties of the polyhedron associated with the shortest path problem

Combinatorial properties of the polyhedron associated with the shortest path problem

The density of the cone decomposition graph associated with the shortest path problem is studied. It is proved that the density is exponential if no restrictions are imposed on the arc lengths. For the classical version of the problem with nonnegative arc lengths, it is shown that the density is pol...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Z̆urnal vyc̆islitelʹnoj matematiki i matematic̆eskoj fiziki 2004-09, Vol.44 (9), p.1693-1696
1. Verfasser: Maksimenko, A N
Format: Artikel
Sprache:rus
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The density of the cone decomposition graph associated with the shortest path problem is studied. It is proved that the density is exponential if no restrictions are imposed on the arc lengths. For the classical version of the problem with nonnegative arc lengths, it is shown that the density is polynomial.
ISSN:0044-4669