标题 |
[高分] Solving hard constrained shortest path problems by Lagrangean relaxation and branch-and-bound algorithms
|
网址 |
求助人暂未提供
|
DOI |
暂未提供,该求助的时间将会延长,查看原因?
|
其它 |
期刊名Methods of Operations Research,年份1986 Ribeiro C, Minoux M. Solving hard constrained shortest path problems by Lagrangean relaxation and branch-and-bound algorithms[J]. Methods of Operations Research, 1986, 53: 303-316. 谷歌学术仅能搜到论文标题及引用信息,如上。 |
求助人 | |
下载 |