咨询与建议

限定检索结果

文献类型

  • 296 篇 期刊文献
  • 55 篇 会议
  • 2 篇 学位论文

馆藏范围

  • 353 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 227 篇 工学
    • 179 篇 计算机科学与技术...
    • 32 篇 电气工程
    • 20 篇 软件工程
    • 15 篇 机械工程
    • 12 篇 生物工程
    • 11 篇 信息与通信工程
    • 10 篇 控制科学与工程
    • 9 篇 交通运输工程
    • 8 篇 电子科学与技术(可...
    • 5 篇 土木工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 光学工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 农业工程
  • 169 篇 理学
    • 144 篇 数学
    • 16 篇 生物学
    • 12 篇 统计学(可授理学、...
    • 3 篇 物理学
    • 2 篇 化学
    • 1 篇 系统科学
  • 138 篇 管理学
    • 138 篇 管理科学与工程(可...
    • 20 篇 工商管理
  • 27 篇 经济学
    • 22 篇 应用经济学
    • 5 篇 理论经济学
  • 2 篇 法学
    • 2 篇 社会学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
    • 1 篇 作物学
  • 1 篇 医学
    • 1 篇 药学(可授医学、理...
  • 1 篇 军事学

主题

  • 353 篇 exact algorithm
  • 21 篇 dynamic programm...
  • 12 篇 combinatorial op...
  • 11 篇 approximation al...
  • 10 篇 fixed-parameter ...
  • 9 篇 computational ge...
  • 9 篇 heuristics
  • 9 篇 branch-and-bound
  • 8 篇 optimization
  • 8 篇 scheduling
  • 7 篇 np-hard problem
  • 7 篇 approximate algo...
  • 7 篇 heuristic
  • 7 篇 shortest path
  • 7 篇 satisfiability
  • 7 篇 complexity
  • 7 篇 knapsack problem
  • 6 篇 traveling salesm...
  • 6 篇 routing
  • 6 篇 np-hard

机构

  • 9 篇 kyonggi univ dep...
  • 8 篇 univ elect sci &...
  • 5 篇 sobolev inst mat...
  • 5 篇 nanjing univ sch...
  • 5 篇 dongbei univ fin...
  • 4 篇 natl univ singap...
  • 4 篇 northeastern uni...
  • 4 篇 univ laval canad...
  • 4 篇 kyoto univ dept ...
  • 4 篇 univ cologne ins...
  • 3 篇 univ alberta dep...
  • 3 篇 kyoto univ grad ...
  • 3 篇 texas a&m univ d...
  • 3 篇 univ laval cirre...
  • 3 篇 univ jena inst i...
  • 3 篇 novosibirsk stat...
  • 3 篇 postech dept com...
  • 3 篇 cent south univ ...
  • 3 篇 kobe univ grad s...
  • 3 篇 kyonggi univ div...

作者

  • 12 篇 bae sang won
  • 7 篇 yu yang
  • 7 篇 xiao mingyu
  • 6 篇 coelho leandro c...
  • 6 篇 tang jiafu
  • 6 篇 saurabh saket
  • 5 篇 okamoto yoshio
  • 5 篇 tanaka shunji
  • 4 篇 laporte gilbert
  • 4 篇 lim andrew
  • 4 篇 yamaguchi kazuak...
  • 4 篇 masuda sumio
  • 4 篇 sun wei
  • 4 篇 nagamochi hirosh...
  • 4 篇 rajasekaran sang...
  • 4 篇 lin guohui
  • 4 篇 seto kazuhisa
  • 4 篇 niedermeier rolf
  • 4 篇 wang junwei
  • 4 篇 wei lijun

语言

  • 312 篇 英文
  • 39 篇 其他
  • 1 篇 中文
检索条件"主题词=exact algorithm"
353 条 记 录,以下是131-140 订阅
排序:
A simple and fast heuristic for protein structure comparison
收藏 引用
BMC BIOINFORMATICS 2008年 第1期9卷 1-16页
作者: Pelta, David A. Gonzalez, Juan R. Vega, Marcos Moreno Univ Granada Dept Comp Sci & Artificial Intelligence Models Decis & Optimizat Res Grp E-18071 Granada Spain Univ La Laguna Dept Stat Operat Res & Computat DEIOC E-38207 San Cristobal la Laguna Spain
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Map Overlap problem (MAX-CMO) one of the... 详细信息
来源: 评论
The minimum weight triangulation problem with few inner points
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2006年 第3期34卷 149-158页
作者: Hoffmann, Michael Okamoto, Yoshio Toyohashi Univ Technol Dept Informat & Comp Sci Tempa Ku Aichi 4418580 Japan Swiss Fed Inst Technol Inst Theoret Comp Sci CH-8092 Zurich Switzerland
We look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the interior of the convex hull). As a case... 详细信息
来源: 评论
Definition and algorithms for Reliable Steiner Tree Problem
收藏 引用
Journal of Systems Science & Complexity 2015年 第4期28卷 876-886页
作者: TANG Yaohua YANG Wenguo GUO Tiande School of Mathematics University of Chinese Academy of Sciences
This paper considers a new form of the Steiner tree problem that is more practical and reliable,which we call Reliable Steiner Tree(RST)*** authors give a detailed definition for this new problem and design both an ex... 详细信息
来源: 评论
Channel assignment via fast zeta transform
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第15期111卷 727-730页
作者: Cygan, Marek Kowalik, Lukasz Univ Warsaw Inst Informat PL-00325 Warsaw Poland
We show an 0*((l + 1)(n))-time algorithm for the channel assignment problem, where l is the maximum edge weight. This improves on the previous o*((l + 2)(n))-time algorithm by Kral (2005) [1], as well as algorithms fo... 详细信息
来源: 评论
Optimization Coordinated seru scheduling and distribution operation problems with DeJong's learning effects
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2024年 第2期313卷 452-464页
作者: Zhang, Zhe Song, Xiaoling Gong, Xue Yin, Yong Lev, Benjamin Zhou, Xiaoyang Nanjing Univ Sci & Technol Sch Econ & Management Nanjing 210094 Peoples R China Doshisha Univ Grad Sch Business Karasuma Imadegawa Kamigyo-ku Kyoto 6028580 Japan Drexel Univ LeBow Coll Business Dept Decis Sci Philadelphia PA 19104 USA Xi An Jiao Tong Univ Sch Management Xian 710049 Peoples R China
Inspired by the advantage of just-in-time philosophy, zero-inventory is common in many industries, es-pecially those need fast response with a short lifespan. Accordingly, this paper focuses on coordinated production ... 详细信息
来源: 评论
Complexity of Grundy coloring and its variants
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 243卷 99-114页
作者: Bonnet, Edouard Foucaud, Florent Kim, Eun Jung Sikora, Florian Hungarian Acad Sci MTA SZTAKI Inst Comp Sci & Control Budapest Hungary Univ Blaise Pascal CNRS LIMOS Clermont Ferrand France PSL Res Univ Univ Paris Dauphine CNRS LAMSADE Paris France ENS Lyon LIP Lyon France
The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of GRUNDY COLORING, the problem of det... 详细信息
来源: 评论
Modeling and solving the waste valorization production and distribution scheduling problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年 第1期306卷 400-417页
作者: Chagas, Guilherme O. Coelho, Leandro C. Darvish, Maryam Renaud, Jacques Univ Laval CIRRELT Quebec City PQ Canada Univ Laval Fac Sci Adm Quebec City PQ Canada Univ Laval Canada Res Chair Integrated Logist Quebec City PQ Canada
Bio-based waste valorization is one of the current trends in municipal waste management. It decreases the amount of waste to be disposed of, reduces the sourcing of limited chemical compounds used in fertilizer produc... 详细信息
来源: 评论
An efficient algorithm for spare allocation problems
收藏 引用
IEEE TRANSACTIONS ON RELIABILITY 2006年 第2期55卷 369-378页
作者: Lin, Hung-Yau Yeh, Fu-Min Kuo, Sy-Yen Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Chung Shan Inst Sci & Technol Taoyuan Taiwan Natl Taiwan Ocean Univ Dept Comp Sci & Engn Chilung Taiwan
The spare allocation problem in redundant RAM is to replace faulty rows/columns of memory cells with spare rows/columns. To solve the problem, comparison-based search tree structures were used in traditional exact alg... 详细信息
来源: 评论
On exact solutions to the Euclidean bottleneck Steiner tree problem
收藏 引用
INFORMATION PROCESSING LETTERS 2010年 第16期110卷 672-678页
作者: Bae, Sang Won Lee, Chunseok Choi, Sunghee Kyonggi Univ Dept Comp Sci Suwon South Korea Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea
We study the Euclidean bottleneck Steiner tree problem: given a set P of n points in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest ... 详细信息
来源: 评论
Mitigating overtime risk in tactical surgical scheduling
收藏 引用
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2020年 93卷
作者: Zhang, Yu Wang, Yu Tang, Jiafu Lim, Andrew Southwestern Univ Finance & Econ Sch Business Adm Chengdu 611130 Peoples R China Northeastern Univ Sch Business Adm Dept Management Sci & Engn Shenyang 110004 Peoples R China Dongbei Univ Finance & Econ Coll Management Sci & Engn Dalian 116025 Peoples R China Natl Univ Singapore Dept Ind Syst Engn & Management Singapore 117576 Singapore
Overtime is a common phenomenon in surgery departments, causing stress to physicians, dissatisfaction to patients, and financial loss to hospitals. We help risk-averse managers of operating rooms (ORs) to mitigate ove... 详细信息
来源: 评论