论文信息 - A note on the constrained shortest‐path problem - 字舞流文

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.

Arun K. Pujari | Suneeta Agarwal | V. P. Gulati

[1] Y. P. Aneja,et al. Two problems in multicommodity networks , 1979 .

[2] Y. Aneja,et al. The constrained shortest path problem , 1978 .