咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation algorithm"
3229 条 记 录,以下是3071-3080 订阅
排序:
A novel health prognosis method for system based on improved degenerated Hidden Markov model
收藏 引用
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING 2022年 第0期78卷
作者: Liu, Qinming Chen, Xiang Dong, Ming Chen, Frank Univ Shanghai Sci & Technol Business Sch Dept Ind Engn 516 Jungong Rd Shanghai 200093 Peoples R China Shanghai Jiao Tong Univ Antai Coll Econ & Management Dept Operat Management 1954 Huashan Rd Shanghai 200030 Peoples R China Univ Texas San Antonio Dept Mech Engn San Antonio TX 78249 USA
Health prognosis for power system is considered as a crucial process of condition-based maintenance. In order to solve the problem of large deviation between Hidden Markov Model and actual system health diagnosis, thi... 详细信息
来源: 评论
Approximate and exact algorithms for an energy minimization traveling salesman problem
收藏 引用
JOURNAL OF CLEANER PRODUCTION 2020年 249卷 119433-000页
作者: Wang, Shijin Liu, Ming Chu, Feng Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China Univ Paris Saclay Univ Evry Lab IBISC F-91025 Evry France Fuzhou Univ Sch Econ & Management Fuzhou 350116 Peoples R China
Energy saving is a great challenge for clean transportation. In this paper, we study the Energy Minimization Traveling Salesman Problem (EMTSP), which is a generation of the classical Traveling Salesman Problem (TSP),... 详细信息
来源: 评论
algorithmic aspects of secure domination in unit disk graphs
收藏 引用
INFORMATION AND COMPUTATION 2023年 第PartB期295卷
作者: Wang, Cai-Xia Yang, Yu Xu, Shou-Jun Lanzhou Univ Gansu Ctr Appl Math Sch Math & Stat Lanzhou 730000 Gansu Peoples R China
Given a graph G with vertex set V, a set S subset of V is a secure dominating set of G if S is a dominating set of G and if for every vertex u is an element of V \ S, there exists a vertex v is an element of S adjacen... 详细信息
来源: 评论
2-node-connectivity network design
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 987卷
作者: Nutov, Zeev Open Univ Israel Raanana Israel
We consider 2-connectivity network design problems in which we are given a graph and seek a min-size 2-connected subgraph that satisfies a prescribed property. center dot In the 1-CONNECTIVITY AUGMENTATION problem the... 详细信息
来源: 评论
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
收藏 引用
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2022年 第6期39卷 2250013-2250013页
作者: Ha, Dung T. K. Pham, Canh, V Hoang, Huan X. Univ Engn & Technol Vietnam Natl Univ Fac Informat Technol 144 Xuan Thuy St Hanoi 10000 Vietnam Phenikaa Univ Fac Comp Sci ORLab Yen Nghia Ward Hanoi 12116 Vietnam
The field of Submodular Maximization subject to a Knapsack constraint has recently expanded to a variety of application domains, which is facing some challenges such as data explosions or additional conditions. There ... 详细信息
来源: 评论
Optimizing incremental SDN upgrades for load balancing in ISP networks
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 第1期962卷
作者: Cheng, Yunlong Zhou, Hao Gao, Xiaofeng Zheng, Jiaqi Chen, Guihai Shanghai Jiao Tong Univ Dept Comp Sci & Engn MoE Key Lab Artificial Intelligence Shanghai 200240 Peoples R China Meituan Beijing 100102 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Peoples R China
Software defined network (SDN) can dynamically and timely reply to the changes of network states, thus enabling advance traffic engineering mechanisms. To enhance the management ability of the network, Internet Servic... 详细信息
来源: 评论
Static Pricing: Universal Guarantees for Reusable Resources
收藏 引用
OPERATIONS RESEARCH 2022年 第2期70卷 1143-1152页
作者: Besbes, Omar Elmachtoub, N. Adam Sun, Yunjie Columbia Business Sch New York NY 10027 USA Columbia Univ Department Ind Engn & Operat Res New York NY 10027 USA Columbia Univ Data Sci Inst New York NY 10027 USA Columbia Univ Dept Ind Engn & Operat Res New York NY 10027 USA
We consider a fundamental pricing model in which a fixed number of units of a reusable resource are used to serve customers. Customers arrive to the system according to a stochastic process and, upon arrival, decide w... 详细信息
来源: 评论
On the Minimum Common Integer Partition Problem
收藏 引用
ACM TRANSACTIONS ON algorithmS 2008年 第1期5卷 1-18页
作者: Chen, Xin Liu, Lan Liu, Zheng Jiang, Tao Google Inc Search Qual Dept Mountain View CA USA Nanyang Technol Univ Sch Phys & Math Sci Singapore Singapore Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA
We introduce a new combinatorial optimization problem in this article, called the minimum common integer partition (MCIP) problem, which was inspired by computational biology applications including ortholog assignment... 详细信息
来源: 评论
Approximated vertex cover for graphs with perfect matchings
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2006年 第8期E89D卷 2405-2410页
作者: Imamura, Tomokazu Iwama, Kazuo Tsukiji, Tatsuie Kyoto Univ Sch Informat Kyoto 6068501 Japan Tokyo Denki Univ Dept Informat Sci Saitama 3500394 Japan
Chen and Kanj considered the VERTEX COVER problem for graphs with perfect matchings (VC-PM). They showed that: (i) There is a reduction from general VERTEX COVER to VC-PM, which guarantees that if one can achieve an a... 详细信息
来源: 评论
A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing
收藏 引用
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2016年 第5期33卷 1650039-1650039页
作者: Liu, Shang-Chia Wu, Chin-Chia Fu Jen Catholic Univ Dept Business Adm New Taipei Taiwan Feng Chia Univ Dept Stat Taichung Taiwan
This paper addresses a scheduling problem in a flexible supply chain where the jobs can be either processed in house, or outsourced to a third-party supplier with the goal of minimizing the sum of holding and delivery... 详细信息
来源: 评论