NP-HARD

作品数：93被引量：190H指数：6
导出分析报告
相关领域：自动化与计算机技术理学更多>>
相关作者：陈跃曲润涛李肯立李庆华黄川更多>>
相关机构：复旦大学上海交通大学中国科学院上海大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家高技术研究发展计划国家重点基础研究发展计划上海市科学技术发展基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Journal of Systems Science & Complexityx
共 条 记 录，以下是1-4
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Scheduling Problems with Rejection to Minimize the Maximum Flow Time
《Journal of Systems Science & Complexity》2016年第5期1293-1301,共9页ZHANG Liqi LU Lingfa 
supported by the National Nature Science Foundation of China under Grant Nos.11426094,11271338 and U1504103
This paper considers the scheduling problem with rejection on m identical parallel machines to minimize the maximum flow time. The authors show that this problem is NP-hard even when there is a single machine and all ...
关键词：Approximation algorithm NP-HARD rejection penalty scheduling. 
MULTITASK n-VEHICLE EXPLORATION PROBLEM:COMPLEXITY AND ALGORITHM被引量：4
《Journal of Systems Science & Complexity》2012年第6期1080-1092,共13页Yangyang XU Jinchuan CUI 
partly supported by Daqing Oilfield Company Project of PetroCHINA under Grant No.dqc- 2010-xdgl-ky-002;Key Laboratory of Management,Decision and Information Systems,Chinese Academy of Sciences
This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem （MTNVEP）, by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors pro...
关键词：Multitask n-Vehicle Exploration Problem （MTNVEP） NP-HARD strongly NP-hard heuristic algorithm. 
A SELFISH ROUTING BASED NETWORK IMPROVEMENT PROBLEM
《Journal of Systems Science & Complexity》2011年第1期68-78,共11页Binwu ZHANG Shu-Cherng FANG 
The work is supported Hohai University Funds under Grant Nos. XZX/08B002-02, 2009428211, and the US National Science Foundation under Grant No. DMI-0553310.
This paper considers a selfish routing based network improvement problem, in which the authors would like to find a modified latency function that results in a new Nash equilibrium flow satisfying all traffic demands ...
关键词：Nash equilibrium NP-HARD selfish routing price of anarchy. 
EXISTENCE OF 0-1 UNIVERSAL MINIMAL TOTAL DOMINATING FUNCTIONS
《Journal of Systems Science & Complexity》2004年第4期485-491,共7页FANGQizhi 
This research is supported by the National Natural Science Foundation of China (No. 10371114).
In this paper, we study the existence of 0-1 universal minimal total dominating functions in a graph. We establish a formulation of linear inequalities to characterize universal minimal total dominating functions and ...
关键词：total dominating function (TDF) minimal total dominating function (MTDF) universal mtdf BALANCED NP-HARD 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部