Retraction Notice: A New Algorithm for the Shortest Path of Touring Disjoint Convex Polygons
Wang Lijuan1, 2, Jiang Bo*, 1, Deng Ansheng1, Wei Qi2
1 College of Information Science and Technology, Dalian Maritime University, Dalian, 116026, P.R. China
2 Dept of Information and Science, Dalian Institute of Science and Technology, Dalian, 116052, P.R. China
Article Information
Article History:
Electronic publication date: 29/3/2016
Collection year: 2016
© Lijuan et al.; Licensee Bentham Open.
open-access license:
This is an open access article licensed under the terms of the Creative Commons Attribution-Non-Commercial 4.0 International Public License (CC BY-NC 4.0)
(
https://creativecommons.org/licenses/by-nc/4.0/legalcode), which permits unrestricted, non-commercial use, distribution and reproduction in any medium, provided the
work is properly cited.
* Address correspondence to this author at the College of Information Science
and Technology, Dalian Maritime University, Dalian, Liaoning, 116026,
P.R. China; Tel: +8618941199928; Fax: +86 41186245057;
E-mail: newdlhot@163.com
Open Peer Review Details |
Manuscript submitted on
|
Original Manuscript |
Retraction Notice: A New Algorithm for the Shortest Path of Touring Disjoint Convex Polygons |