CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
Carraresi P, Sodini C. A binary enumeration tree to find k shortest paths. Methods of Operations Research (Germany) 7th Symposium on Operations Research, St. Gallen, Switzerland 1983; 177--188
P. Carraresi and C. Sodini. A binary enumeration tree to find k shortest paths. In 7th Symp. Operations Research, pages 177--188. Methods of Operations Research, 1983.
P. Carraresi and C. Sodini. A binary enumeration tree to find K shortest paths. Proc. 7th Symp. Operations Research, pp. 177--188. Athen aum/Hain/Hanstein, Methods of Operations Research 45, 1983.