Complexity of some inverse shortest path lengths problems

The input to an inverse shortest path lengths problem (ISPL) consists of a graph G with arc weights, and a collection of source‐sink pairs with prescribed distances that do not necessarily conform to the shortest path lengths in G. The goal is to modify the arc weights, subject to a penalty on the d...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks Jg. 56; H. 1; S. 20 - 29
Hauptverfasser:	Cui, Tingting, Hochbaum, Dorit S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.08.2010 Wiley
Schlagworte:	Applied sciences complexity Exact sciences and technology inverse optimization Mathematical programming Operational research and scientific management Operational research. Management science polynomial algorithm shortest path complexity inverse optimization Shortest path Routing polynomial algorithm Polynomial method Convex programming Optimization Inverse problem Polynomial time Penalty function NP hard problem Uniformity
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!