descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1984 English Publisher:WileyJournal:Naval Research Logistics Quarterly, volume 31, pages 87-89 (issn: 0028-1441, eissn: 1931-9193,

Authors: Arun K. Pujari; V. P. Gulati; Suneeta Agarwal;

doi: 10.1002/nav.3800310110

A note on the constrained shortest‐path problem

- Summary
- Subjects
- Metrics

Abstract

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

Related Organizations

Indian Institute of Technology Kanpur
India

Keywords

Extremal problems in graph theory, Numerical mathematical programming methods, convergence condition, Deterministic network models in operations research, constrained shortest path, counterexample, Programming involving graphs or networks, bicriteria shortest path, Paths and cycles

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average