咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是171-180 订阅
排序:
A new exact approach for the 0-1 Collapsing Knapsack Problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第1期260卷 56-69页
作者: Della Croce, Federico Salassa, Fabio Scatamacchia, Rosario Politecn Torino Dipartimento Automat & Informat Corso Duca Abruzzi 24 I-10129 Turin Italy Politecn Torino Dipartimento Ingn Gestionale & Prod Corso Duca Abruzzi 24 I-10129 Turin Italy
We consider the 0/1 Collapsing Knapsack Problem (CKP) and a generalization involving more than a capacity constraint (M-CKP). We propose a novel ILP formulation and a problem reduction procedure together with an exact... 详细信息
来源: 评论
On partitioning a graph into two connected subgraphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第48期412卷 6761-6769页
作者: Paulusma, Daniel van Rooij, Johan M. M. Univ Durham Sci Labs Dept Comp Sci Durham DH1 3LE England Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands
Suppose a graph G is given with two vertex-disjoint sets of vertices Z(1) and Z(2). Can we partition the remaining vertices of G such that we obtain two connected vertex-disjoint subgraphs of G that contain Z(1) and Z... 详细信息
来源: 评论
On the Bandpass problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2011年 第1期22卷 71-77页
作者: Lin, Guohui Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
The complexity of the Bandpass problem is re-investigated. Specifically, we show that the problem with any fixed bandpass number Ba parts per thousand yen2 is NP-hard. Next, a row stacking algorithm is proposed for th... 详细信息
来源: 评论
exact and approximate algorithms for the longest induced path problem
收藏 引用
RAIRO-OPERATIONS RESEARCH 2021年 第2期55卷 333-353页
作者: Marzo, Ruslan G. Ribeiro, Celso C. Univ Fed Fluminense Inst Comp BR-24210346 Niteroi RJ Brazil
The longest induced path problem consists in finding a maximum subset of vertices of a graph such that it induces a simple path. We propose a new exact enumerative algorithm that solves problems with up to 138 vertice... 详细信息
来源: 评论
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs
收藏 引用
TRANSPORTATION SCIENCE 2010年 第3期44卷 383-399页
作者: Battarra, Maria Erdogan, Guenes Laporte, Gilbert Vigo, Daniele Univ Bologna Dipartimento Elettron Informat & Sistem I-47521 Cesena FC Italy Ozyegin Univ Dept Ind Engn TR-34662 Istanbul Turkey HEC Montreal Dept Management Sci Montreal PQ J3T 247 Canada
This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The s... 详细信息
来源: 评论
An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2017年 87卷 245-257页
作者: Yu, Yang Lou, Qi Tang, Jiafu Wang, Junwei Yue, XiaoHang Northeastern Univ Inst Syst Engn Shenyang 110816 Liaoning Peoples R China Dongbei Univ Finance & Econ Coll Management Sci & Engn Dalian 116023 Peoples R China Univ Hong Kong Dept Ind & Mfg Syst Engn Pokfulam Rd Hong Kong Hong Kong Peoples R China Univ Wisconsin Lubar Sch Business Milwaukee WI 53201 USA
Compared to the non-cooperative mode, the cooperative mode is a powerful way to reduce operational cost in pickup and delivery service. In order to protect business sensitive information, sometimes participants are un... 详细信息
来源: 评论
Implementation of BFA (Backtrack-Free Path Planning algorithm) for Three-Dimensional Workspaces and Its Application to Path Planning of Multi Manipulators
收藏 引用
ELECTRONICS AND COMMUNICATIONS IN JAPAN 2011年 第12期94卷 1-11页
作者: Murata, Tomonari Tamura, Shinsuke Kawai, Masayuki Univ Fukui Grad Sch Engn Fukui Japan
Together with a newly developed method for avoiding collisions between links themselves, the BFA (Backtrack-Free path planning algorithm) has been implemented for calculating the paths of manipulators that are operate... 详细信息
来源: 评论
Location, pricing and the problem of Apollonius
收藏 引用
OPTIMIZATION LETTERS 2017年 第8期11卷 1797-1805页
作者: Berger, Andre Grigoriev, Alexander Panin, Artem Winokurow, Andrej Maastricht Univ Dept Quantitat Econ Sch Business & Econ POB 616 NL-6200 MD Maastricht Netherlands Sobolev Inst Math Acad Koptyug Ave 4 Novosibirsk 630090 Russia Novosibirsk State Univ 2 Pirogov Str Novosibirsk 630090 Russia
In Euclidean plane geometry, Apollonius' problem is to construct a circle in a plane that is tangent to three given circles. We will use a solution to this ancient problem to solve several versions of the followin... 详细信息
来源: 评论
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... 详细信息
来源: 评论
algorithms for randomized time-varying knapsack problems
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年 第1期31卷 95-117页
作者: He, Yichao Zhang, Xinlu Li, Wenbin Li, Xiang Wu, Weili Gao, Suogang Shijiazhuang Univ Econ Coll Informat Engn Shijiazhuang 050031 Peoples R China Hebei Normal Univ Coll Math & Informat Sci Shijiazhuang 050024 Peoples R China Shijiazhuang Univ Econ Lab Network & Informat Secur Shijiazhuang 050031 Peoples R China Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
In this paper, we first give the definition of randomized time-varying knapsack problems () and its mathematic model, and analyze the character about the various forms of . Next, we propose three algorithms for : (1) ... 详细信息
来源: 评论