A note on the constrained shortest-path problem

The subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest‐path problem.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Naval research logistics quarterly 1984-03, Vol.31 (1), p.87-89
Hauptverfasser:	Pujari, Arun K., Agarwal, Suneeta, Gulati, V. P.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Miscellaneous Operational research and scientific management Operational research. Management science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest‐path problem.
ISSN:	0028-1441 1931-9193
DOI:	10.1002/nav.3800310110