Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem
文献类型:期刊论文
作者 | Yu, Fang1,2; Cui, Jin-chuan2![]() |
刊名 | ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
![]() |
出版日期 | 2018-07-01 |
卷号 | 34期号:3页码:645-657 |
关键词 | computational complexity efficient computation mechanism N-vehicle exploration problem cluster |
ISSN号 | 0168-9673 |
DOI | 10.1007/s10255-018-0774-6 |
英文摘要 | The 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. |
资助项目 | Key Laboratory of Management, Decision and Information Systems, Chinese Academy of Science |
WOS研究方向 | Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000441231700015 |
出版者 | SPRINGER HEIDELBERG |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/30803] ![]() |
专题 | 应用数学研究所 |
通讯作者 | Cui, Jin-chuan |
作者单位 | 1.Beijing Univ Chinese Med, Beijing 102488, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China |
推荐引用方式 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. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。