首页 | 本学科首页   官方微博 | 高级检索  
   检索      


A note on the constrained shortest-path problem
Authors:Arun K Pujari  Suneeta Agarwal  V P Gulati
Institution:Department of Mathematics, Indian Institute of Technology, Kanpur 208016, India
Abstract:The subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest-path problem.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号