Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Kameng Nip, Zhenbo Wang, Wenxun Xing. Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. In Dachuan Xu, Donglei Du, Dingzhu Du, editors, Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings. Volume 9198 of Lecture Notes in Computer Science, pages 97-108, Springer, 2015. [doi]

This author has not been identified. Look up 'Kameng Nip' in GoogleThis author has not been identified. Look up 'Zhenbo Wang' in GoogleThis author has not been identified. Look up 'Wenxun Xing' in Google

runs on WebDSL