咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 355 篇 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
  • 7 篇 np-hard problem
  • 7 篇 approximate algo...
  • 7 篇 heuristic
  • 7 篇 shortest path
  • 7 篇 satisfiability
  • 7 篇 complexity
  • 7 篇 knapsack problem
  • 6 篇 routing
  • 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

语言

  • 314 篇 英文
  • 38 篇 其他
  • 1 篇 中文
检索条件"主题词=exact algorithm"
355 条 记 录,以下是131-140 订阅
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
收藏 引用
NETWORKS 2019年 第1期73卷 89-103页
作者: Brazil, Marcus Volz, Marcus Zachariasen, Martin Ras, Charl Thomas, Doreen Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia Univ Melbourne Dept Mech Engn Melbourne Vic Australia Univ So Denmark Det Naturvidenskabelige Fak Odense Denmark Univ Melbourne Math & Stat Melbourne Vic Australia
We present a new exact algorithm for computing minimum 2-edge-connected Steiner networks in the Euclidean plane. The algorithm is based on the GeoSteiner framework for computing minimum Steiner trees in the plane. Sev... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Resolution and linear CNF formulas: Improved (n, 3)-MAxSAT algorithms
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 774卷 113-123页
作者: Xu, Chao Chen, Jianer Wang, Jianxin Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA
We study techniques for solving the MAxSAT problem on instances in which the variable degree is bounded by 3. The problem is NP-hard. We show how resolution principle can be applied that converts an instance into an e... 详细信息
来源: 评论
Minimum-width annulus with outliers: Circular, square, and rectangular cases
收藏 引用
INFORMATION PROCESSING LETTERS 2019年 145卷 16-23页
作者: Ahn, Hee-Kap Ahn, Taehoon Bae, Sang Won Choi, Jongmin Kim, Mincheol Oh, Eunjin Shin, Chan-Su Yoon, Sang Duk POSTECH Dept Comp Sci & Engn Pohang South Korea Kyonggi Univ Div Comp Sci & Engn Suwon South Korea Max Planck Inst Informat Saarbrucken Germany Hankuk Univ Foreign Studies Div Comp & Elect Syst Engn Seoul South Korea Samsung Display Co Ltd Yongin South Korea
We study the problem of computing a minimum-width annulus with outliers. Specifically, given a set of n points in the plane and an integer k with 1 <= k <= n, the problem asks to find a minimum-width annulus tha... 详细信息
来源: 评论
exact solution methods for the multi-period vehicle routing problem with due dates
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2019年 第Oct.期110卷 148-158页
作者: Larrain, Homero Coelho, Leandro C. Archetti, Claudia Speranza, M. Grazia Pontificia Univ Catolica Chile Santiago Chile Univ Laval CIRRELT Quebec City PQ Canada Univ Laval Canada Res Chair Integrated Logist Quebec City PQ Canada Univ Brescia Dept Econ & Management Brescia Italy
In this paper we study the multi-period vehicle routing problem with due dates. A supplier has to determine a distribution plan to visit a set of customers over a given planning horizon. Each customer is associated wi... 详细信息
来源: 评论
Computing a minimum-width cubic and hypercubic shell
收藏 引用
OPERATIONS RESEARCH LETTERS 2019年 第5期47卷 398-405页
作者: Bae, Sang Won Kyonggi Univ Div Comp Sci & Engn Suwon South Korea
This paper addresses the problem of computing a minimum-width axis-aligned cubic shell enclosing a given set of n points in R-3. A cubic shell is a closed volume between two concentric and face-parallel cubes. Prior t... 详细信息
来源: 评论
Heterogeneous vehicle pickup and delivery problems: Formulation and exact solution
收藏 引用
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2019年 第May期125卷 181-202页
作者: Sun, Wei Yu, Yang Wang, Junwei Liaoning Univ Sch Business Shenyang 110316 Liaoning Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Dept Intelligent Syst Engn Shenyang 110819 Liaoning Peoples R China Univ Hong Kong Dept Ind & Mfg Syst Engn Pokfulam Rd Hong Kong Peoples R China
The heterogeneous green pickup and delivery problem (GPDP) aims to minimize carbon emissions of pickups and deliveries by a fleet of heterogeneous vehicles. We propose the first exact algorithm for solving the heterog... 详细信息
来源: 评论
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
收藏 引用
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2019年 89卷 71-91页
作者: Li, Chongshou Gong, Lijun Luo, Zhixing Lim, Andrew Nanjing Univ Sch Management & Engn Nanjing 210093 Jiangsu Peoples R China Natl Univ Singapore Dept Ind Syst Engn & Management 1Engn Dr 2 Singapore 117576 Singapore City Univ Hong Kong Dept Management Sci Kowloon Tong Tat Chee Ave Hong Kong Peoples R China
We investigate a real-world product distribution problem faced by a fast fashion retailer in Singapore. It is a generalization of the multi-commodity pickup and delivery traveling salesman problem (m-PDTSP) proposed b... 详细信息
来源: 评论
New exact approaches and approximation results for the Penalized Knapsack Problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2019年 253卷 122-135页
作者: Della Croce, Federico Pferschy, Ulrich Scatamacchia, Rosario Politecn Torino Dipartimento Ingn Gest & Prod Corso Duca Abruzzi 24 I-10129 Turin Italy CNR IEIIT Turin Italy Karl Franzens Univ Graz Dept Stat & Operat Res Univ Str 15 A-8010 Graz Austria
We consider the 0-1 Penalized Knapsack Problem (PKP). Each item has a profit, a weight and a penalty and the goal is to maximize the sum of the profits minus the greatest penalty value of the items included in a solut... 详细信息
来源: 评论
A maximum edge-weight clique extraction algorithm based on branch-and-bound
收藏 引用
DISCRETE OPTIMIZATION 2020年 37卷 100583-100583页
作者: Shimizu, Satoshi Yamaguchi, Kazuaki Masuda, Sumio Kobe Univ Grad Sch Engn Kobe Hyogo Japan
The maximum edge-weight clique problem is to find a clique whose sum of edgeweight is the maximum for a given edge-weighted undirected graph. The problem is NP-hard and some branch-and-bound algorithms have been propo... 详细信息
来源: 评论