咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 232 篇 工学
    • 179 篇 计算机科学与技术...
    • 32 篇 电气工程
    • 20 篇 软件工程
    • 15 篇 机械工程
    • 15 篇 信息与通信工程
    • 12 篇 生物工程
    • 10 篇 控制科学与工程
    • 9 篇 交通运输工程
    • 8 篇 电子科学与技术(可...
    • 5 篇 土木工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 光学工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 农业工程
  • 169 篇 理学
    • 143 篇 数学
    • 16 篇 生物学
    • 12 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 3 篇 化学
    • 1 篇 系统科学
  • 138 篇 管理学
    • 137 篇 管理科学与工程(可...
    • 20 篇 工商管理
  • 28 篇 经济学
    • 23 篇 应用经济学
    • 5 篇 理论经济学
  • 11 篇 医学
  • 3 篇 法学
    • 2 篇 社会学
    • 1 篇 法学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
  • 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 篇 routing
  • 6 篇 np-hard
  • 6 篇 independent set

机构

  • 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 条 记 录,以下是41-50 订阅
排序:
An exact algorithm for the precedence-constrained single-machine scheduling problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2013年 第2期229卷 345-352页
作者: Tanaka, Shunji Sato, Shun Kyoto Univ Dept Elect Engn Nishikyo Ku Kyoto 6158510 Japan
This study proposes an efficient exact algorithm for the precedence-constrained single-machine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is b... 详细信息
来源: 评论
An exact algorithm for minimum distortion embedding
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第29期412卷 3530-3536页
作者: Fomin, Fedor V. Lokshtanov, Daniel Saurabh, Saket Univ Bergen Dept Informat N-5020 Bergen Norway Univ Calif San Diego Dept Comp Sci & Engn San Diego CA 92103 USA Inst Math Sci Chennai 600113 Tamil Nadu India
Let G be an unweighted connected graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5(n+0(n)). This is the first algorithm breaki... 详细信息
来源: 评论
An exact algorithm for maximum lifetime data gathering tree without aggregation in wireless sensor networks
收藏 引用
WIRELESS NETWORKS 2015年 第1期21卷 281-295页
作者: Zhu, Xiaojun Wu, Xiaobing Chen, Guihai Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing 210016 Jiangsu Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Shanghai 200240 Peoples R China
In wireless sensor networks, maximizing the lifetime of a data gathering tree without aggregation has been proved to be NP-complete. In this paper, we prove that, unless P = NP, no polynomial-time algorithm can approx... 详细信息
来源: 评论
On the complexity of exact algorithm for L(2,1)-labeling of graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第14期111卷 697-701页
作者: Junosza-Szaniawski, Konstanty Rzazewski, Pawel Warsaw Univ Technol Fac Math & Informat Sci PL-00661 Warsaw Poland
L(2, 1)-labeling is a graph coloring model inspired by a frequency assignment in telecommunication. It asks for such a labeling of vertices with nonnegative integers that adjacent vertices get labels that differ by at... 详细信息
来源: 评论
An exact algorithm for single-machine scheduling without machine idle time
收藏 引用
JOURNAL OF SCHEDULING 2009年 第6期12卷 575-593页
作者: Tanaka, Shunji Fujikuma, Shuji Araki, Mituhiko Kyoto Univ Grad Sch Elect Engn Nishikyo Ku Kyoto 6158510 Japan Matsue Coll Technol Matsue Shimane 6908518 Japan
This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynami... 详细信息
来源: 评论
An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model
收藏 引用
JOURNAL OF INTELLIGENT MANUFACTURING 2011年 第5期22卷 789-799页
作者: Dong, Gang Tang, Jiafu Lai, Kin Keung Kong, Yuan City Univ Hong Kong Dept Management Sci Kowloon Hong Kong Peoples R China Northeastern Univ Inst Syst Engn Shenyang Peoples R China
This paper addresses a vehicle routing and scheduling problem arising in Flight Ticket Sales Companies for the service of free pickup and delivery of airline passengers to the airport. The problem is formulated under ... 详细信息
来源: 评论
An exact algorithm for a multicommodity min-cost flow over time problem
收藏 引用
Electronic Notes in Discrete Mathematics 2018年 64卷 125-134页
作者: Grande, Enrico Nicosia, Gaia Pacifici, Andrea Roselli, Vincenzo Axioma Inc. London United Kingdom Dipartimento di Ingegneria Università Roma Tre Roma Italy Dipartimento di Ingegneria Civile e Ingegneria Informatica Università di Roma Tor Vergata Roma Italy Dipartimento di Ingegneria Università Roma Tre Roma Italy
Flows over time problems consider finding optimal dynamic flows over a network where capacities and transit times on arcs are given. In this paper we study a multicommodity flow over time problem in which no storage o... 详细信息
来源: 评论
An exact algorithm for a core/periphery bipartitioning problem
收藏 引用
SOCIAL NETWORKS 2011年 第1期33卷 12-19页
作者: Brusco, Michael Florida State Univ Coll Business Dept Mkt Tallahassee FL 32306 USA
The discrete optimization problem associated with partitioning a set of actors into core and periphery subsets has typically been approached using approximate procedures such as exchange heuristics, genetic algorithms... 详细信息
来源: 评论
An Approach to Study the range of perturbations in exact algorithm on Microwave Tomography of Biological targets with different BeamWidth  3
An Approach to Study the range of perturbations in Exact Alg...
收藏 引用
THIRD INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND INFORMATION TECHNOLOGY (C3IT)
作者: Purkait, Kabita Mondal, Subijit Bose, Subhra Narayan Roy, Rounak Halder, Shuvankar Adhikary, Kalyan Kalyani Govt Engn Coll Dept Elect & Commun Engn Kalyani W Bengal India Mordern Inst Engn & Technol Dept Elect & Commun Engn Kalyani W Bengal India
In this paper, a study of existing exact algorithm on microwave tomography of high contrast biological model for different sets of transmitting beamwidth has been proposed. Quantitative results of reconstructed images... 详细信息
来源: 评论
AN exact algorithm FOR THE FULL TRUCKLOAD PICK-UP AND DELIVERY PROBLEM WITH TIME WINDOWS: CONCEPT AND IMPLEMENTATION DETAILS
AN EXACT ALGORITHM FOR THE FULL TRUCKLOAD PICK-UP AND DELIVE...
收藏 引用
25th European Simulation and Modelling Conference (ESM 2011)
作者: Janssens, Gerrit K. Braekers, Kris Univ Hasselt Hasselt Univ Transportat Res Inst IMOB B-3590 Diepenbeek Belgium
Intermodal goods transport is characterized by a main transport by rail, barge or seaborne vessel, preceded and followed by short in time but expensive road transport. Many times trucks pick-up or deliver a single con... 详细信息
来源: 评论