CSpace  > 应用数学研究所
Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem
Yu, Fang1,2; Cui, Jin-chuan2
2018-07-01
Source PublicationACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
ISSN0168-9673
Volume34Issue:3Pages:645-657
AbstractThe research of efficient computation focus on special structures of NP-hard problem instances and request providing reasonable computing cost of instances in polynomial time. Based on the theory of combinatorial optimization, by studying the clusters partition and the clusters complexity measurement in N-vehicle exploration problem, we build a frame of efficient computation and provide an application of tractability for NP-hard problem. Three N-vehicle examples show that when we use efficient computation mechanism on N-vehicle, through polynomial steps of tractability analysis, decision makers can get the computing cost of searching optimal solution before practical calculation.
Keywordcomputational complexity efficient computation mechanism N-vehicle exploration problem cluster
DOI10.1007/s10255-018-0774-6
Language英语
Funding ProjectKey Laboratory of Management, Decision and Information Systems, Chinese Academy of Science
WOS Research AreaMathematics
WOS SubjectMathematics, Applied
WOS IDWOS:000441231700015
PublisherSPRINGER HEIDELBERG
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/30804
Collection应用数学研究所
Affiliation1.Beijing Univ Chinese Med, Beijing 102488, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
Recommended Citation
GB/T 7714
Yu, Fang,Cui, Jin-chuan. Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem[J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,2018,34(3):645-657.
APA Yu, Fang,&Cui, Jin-chuan.(2018).Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,34(3),645-657.
MLA Yu, Fang,et al."Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem".ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES 34.3(2018):645-657.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yu, Fang]'s Articles
[Cui, Jin-chuan]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yu, Fang]'s Articles
[Cui, Jin-chuan]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yu, Fang]'s Articles
[Cui, Jin-chuan]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.