云南高校图书馆联盟文献共享服务平台- NP-HARD

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

Single-Machine Scheduling with Step-Deteriorating Jobs and Rejection: 《Journal of the Operations Research Society of China》2024年第4期1088-1102,共15页Fan-Yu Kong Cui-Xia Miao Yu-Jia Huo Jia-Xin Song Yu-Zhong Zhang; supported by the National Natural Science Foundation of China(Nos.12271295 and 12001313);the Provincial Natural Science Foundation of Shandong(No.ZR2022MA019).; In this paper,we consider the single-machine scheduling with step-deteriorating jobs and rejection.Each job is either rejected by paying a rejection penalty,or accepted and processed on the single machine,and the actu...; 关键词：SCHEDULING Step-deteriorating Rejection penalty NP-HARD Fully polynomial time approximation scheme

基于蚁群算法的冷链物流配送路径优化研究与应用: 《统计学与应用》2024年第6期2642-2656,共15页张嘉灏林海堃赵淙浩彭仁昊; 本研究针对旅行商问题的高效求解,探讨了传统算法的局限性,并强调了启发式算法的重要性。我们选取蚁群算法作为研究对象,因其具备自适应性和正反馈机制。然而,ACO在实际应用中常陷入局部最优解的问题,为此我们引入模拟退火算法以增强全...; 关键词：旅行商问题 NP-HARD 启发式算法蚁群算法模拟退火算法

NeuroPrim:An attention-based model for solving NP-hard spanning tree problems被引量：1: 《Science China Mathematics》2024年第6期1359-1376,共18页Yuchen Shi Congying Han Tiande Guo; supported by National Key R&D Program of China(Grant No.2021YFA1000403);National Natural Science Foundation of China(Grant No.11991022);the Strategic Priority Research Program of Chinese Academy of Sciences(Grant No.XDA27000000);the Fundamental Research Funds for the Central Universities。; Spanning tree problems with specialized constraints can be difficult to solve in real-world scenarios,often requiring intricate algorithmic design and exponential time.Recently,there has been growing interest in end-t...; 关键词：degree-constrained minimum spanning tree problem minimum routing cost spanning tree problem Steiner tree problem in graphs Prim's algorithm reinforcement learning

Solving the Generalized Traveling Salesman Problem Using Sequential Constructive Crossover Operator in Genetic Algorithm: 《Computer Systems Science & Engineering》2024年第5期1113-1131,共19页Zakir Hussain Ahmed Maha Ata Al-Furhood Abdul Khader Jilani Saudagar Shakir Khan; the Deanship of Scientific Research,Imam Mohammad Ibn Saud Islamic University(IMSIU),Saudi Arabia,for funding this research work through Grant No.(221412020).; The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is h...; 关键词：Generalized travelling salesman problem NP-HARD genetic algorithms sequential constructive crossover swap mutation

Genetic Crossover Operators for the Capacitated Vehicle Routing Problem被引量：1: 《Computers, Materials & Continua》2023年第1期1575-1605,共31页Zakir Hussain Ahmed Naif Al-Otaibi Abdullah Al-Tameem Abdul Khader Jilani Saudagar; the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University for funding thiswork through Research Group No.RG-21-09-17.; We study the capacitated vehicle routing problem(CVRP)which is a well-known NP-hard combinatorial optimization problem(COP).The aim of the problem is to serve different customers by a convoy of vehicles starting from ...; 关键词：Vehicle routing problem NP-HARD genetic algorithm sequential constructive crossover MUTATION

Minimum Epsilon-Kernel Computation for Large-Scale Data Processing: 《Journal of Computer Science & Technology》2022年第6期1398-1411,共14页Hong-Jie Guo Jian-Zhong Li Hong Gao; the National Natural Science Foundation of China under Grant Nos.61732003,61832003,61972110 and U19A2059;the National Key Research and Development Program of China under Grant No.2019YFB2101902;the CCF-Baidu Open Fund CCF-BAIDU under Grant No.OF2021011.; Kernel is a kind of data summary which is elaborately extracted from a large dataset.Given a problem,the solution obtained from the kernel is an approximate version of the solution obtained from the whole dataset with...; 关键词：approximate query processing KERNEL large-scale dataset NP-HARD

Efficient Partitioning Method for Optimizing the Compression on Array Data: 《Journal of Computer Science & Technology》2022年第5期1049-1067,共19页Shuai Han Xian-Min Liu Jian-Zhong Li; This work was supported by the National Natural Science Foundation of China under Grant Nos.61832003 and U1811461.; Array partitioning is an important research problem in array management area,since the partitioning strategies have important influence on storage,query evaluation,and other components in array management systems.Mean...; 关键词：array partitioning compression performance greedy strategy NP-HARD

Reliable resource allocation with RF fingerprinting authentication in secure IoT networks被引量：1: 《Science China(Information Sciences)》2022年第7期47-62,共16页Weiwei WU Su HU Di LIN Gang WU; partially supported by Science and Technology Program of Sichuan Province (Grant No.2021YFG0330);Intelligent Terminal Key Laboratory of Si Chuan Province (Grant No. SCITLAB-0001);Fundamental Research Funds for the Central Universities (Grant No. ZYGX2019J076);National Natural Science Foundation of China (Grant No.61971092);Province Sichuan Foundation for Distinguished Young Scholars (Grant No. 2020JDJQ0023)。; The unprecedented growth of the Internet of Things(Io T) has led to a huge amount of wireless resource consumption in a network. Due to limited wireless resources, a network can only guarantee the quality of service(Q...; 关键词：user authentication Internet of things convolutional neural network RF fingerprinting NP-hard optimization problem

Generic Tabu Search: 《Journal of Software Engineering and Applications》2022年第7期262-273,共12页Chadi Kallab Samir Haddad Imad El-Zakhem Jinane Sayah Mohamad Chakroun Nisrine Turkey Jinan Charafeddine Hani Hamdan Wafaa Shakir; The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, to implement and run any of the main categor...; 关键词：GENERIC HEURISTICS Bio-Informatics NP-HARD Tabu Search STM LTM

Flexible Traceable Generic Genetic Algorithm: 《Open Journal of Applied Sciences》2022年第6期877-891,共15页Chadi Kallab Samir Haddad Jinane Sayah; This document elaborates on the generic implementation one of the main heuristics algorithms verified through its quick application to a biology problem requiring to find out an optimal sequences tree topology. In ord...; 关键词：GENERIC HEURISTICS PHYLOGENIES Bio-Informatics NP-HARD Genetic Algorithm

NP-HARD