期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Research on the Efficient Computation Mechanism-in the Case of N-vehicle Exploration Problem 被引量:2
1
作者 Fang YU Jin-chuan CUI 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2018年第3期645-657,共13页
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 opti... 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 Nvehicle 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. 展开更多
关键词 computational complexity efficient computation mechanism N-vehicle exploration problem cluster
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部