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.
[1] Y. P. Aneja,et al. Two problems in multicommodity networks , 1979 .
[2] Y. Aneja,et al. The constrained shortest path problem , 1978 .