The equity constrained shortest path problem

This paper examines the problem of finding the shortest path on a network subject to “equity” constraints. A Lagrangean dual bounding approach is utilized, which relaxes the “complicating constraints” of the problem. After solving the Lagrangean dual, the duality gap is closed by finding the t short...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 1990, Vol.17 (3), p.297-307
Hauptverfasser:	Gopalan, Ram, Batta, Rajan, karwan, Mark H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications Applied sciences Constraints Exact sciences and technology Ground, air and sea transportation, marine construction Mathematical models Operations research Routing Transportation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!