Matches in SemOpenAlex for { <https://semopenalex.org/work/W2324856398> ?p ?o ?g. }
Showing items 1 to 64 of
64
with 100 items per page.
- W2324856398 endingPage "364" @default.
- W2324856398 startingPage "356" @default.
- W2324856398 abstract "This paper solves the problem of computing the shortest Euclidean path touring n disjoint circles in 2D which is a generalization of the Travelling Salesman Problem (TSP) in Euclidean 2D plane and is not purely combinatorial. Based on the author’s previous work and the philosophy of Branch-andBound (B&B), this work presents a new exact algorithm to solve the problem. The empirical results have shown the correctness and the performance of the proposed algorithm dealing with a small number of circles. The proposed algorithm can be conducted in layered manufacturing of rapid prototyping, displacement of wireless sensor networks, or other related computer-aided design and manufacturing applications." @default.
- W2324856398 created "2016-06-24" @default.
- W2324856398 creator A5063010564 @default.
- W2324856398 date "2012-06-30" @default.
- W2324856398 modified "2023-10-16" @default.
- W2324856398 title "On the Shortest Path Touring n Circles" @default.
- W2324856398 cites W1984035910 @default.
- W2324856398 cites W1997650212 @default.
- W2324856398 cites W2031736545 @default.
- W2324856398 cites W2059142560 @default.
- W2324856398 cites W2110824994 @default.
- W2324856398 cites W2125334953 @default.
- W2324856398 cites W2140596151 @default.
- W2324856398 cites W2158989627 @default.
- W2324856398 cites W2317792772 @default.
- W2324856398 cites W2322454996 @default.
- W2324856398 cites W2569071700 @default.
- W2324856398 cites W307896644 @default.
- W2324856398 doi "https://doi.org/10.4156/ijact.vol4.issue10.42" @default.
- W2324856398 hasPublicationYear "2012" @default.
- W2324856398 type Work @default.
- W2324856398 sameAs 2324856398 @default.
- W2324856398 citedByCount "4" @default.
- W2324856398 countsByYear W23248563982014 @default.
- W2324856398 countsByYear W23248563982018 @default.
- W2324856398 crossrefType "journal-article" @default.
- W2324856398 hasAuthorship W2324856398A5063010564 @default.
- W2324856398 hasConcept C132525143 @default.
- W2324856398 hasConcept C22590252 @default.
- W2324856398 hasConcept C2777735758 @default.
- W2324856398 hasConcept C31258907 @default.
- W2324856398 hasConcept C38652104 @default.
- W2324856398 hasConcept C41008148 @default.
- W2324856398 hasConcept C76155785 @default.
- W2324856398 hasConcept C80444323 @default.
- W2324856398 hasConceptScore W2324856398C132525143 @default.
- W2324856398 hasConceptScore W2324856398C22590252 @default.
- W2324856398 hasConceptScore W2324856398C2777735758 @default.
- W2324856398 hasConceptScore W2324856398C31258907 @default.
- W2324856398 hasConceptScore W2324856398C38652104 @default.
- W2324856398 hasConceptScore W2324856398C41008148 @default.
- W2324856398 hasConceptScore W2324856398C76155785 @default.
- W2324856398 hasConceptScore W2324856398C80444323 @default.
- W2324856398 hasIssue "10" @default.
- W2324856398 hasLocation W23248563981 @default.
- W2324856398 hasOpenAccess W2324856398 @default.
- W2324856398 hasPrimaryLocation W23248563981 @default.
- W2324856398 hasRelatedWork W2023505575 @default.
- W2324856398 hasRelatedWork W2030496847 @default.
- W2324856398 hasRelatedWork W2316925676 @default.
- W2324856398 hasRelatedWork W2317449002 @default.
- W2324856398 hasRelatedWork W2371125232 @default.
- W2324856398 hasRelatedWork W2373437113 @default.
- W2324856398 hasRelatedWork W2384965074 @default.
- W2324856398 hasRelatedWork W2384974102 @default.
- W2324856398 hasRelatedWork W3040193770 @default.
- W2324856398 hasRelatedWork W3106476875 @default.
- W2324856398 hasVolume "4" @default.
- W2324856398 isParatext "false" @default.
- W2324856398 isRetracted "false" @default.
- W2324856398 magId "2324856398" @default.
- W2324856398 workType "article" @default.