咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是181-190 订阅
排序:
Computational analysis of a flexible assembly system design problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年 第3期123卷 453-472页
作者: Kumar, A Jacobson, SH Sewell, EC So Illinois Univ Dept Math & Stat Edwardsville IL 62026 USA Grand Valley State Univ Seidman Sch Business Grand Rapids MI 49504 USA Univ Illinois Dept Mech & Ind Engn Urbana IL 61801 USA
Global competitive priorities are undergoing a marked shift from productivity and quality to flexibility and agility. This has resulted in a growing number of manufacturing companies realizing the importance of buildi... 详细信息
来源: 评论
An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
收藏 引用
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2017年 第3期68卷 661-669页
作者: Berger, Andre Grigoriev, Alexander Winokurow, Andrej Maastricht Univ POB 616 NL-6200 MD Maastricht Netherlands
The single facility location problem with demand regions seeks for a facility locationminimizing the sum of the distances from n demand regions to the facility. The demand regions represent sales markets where the tra... 详细信息
来源: 评论
On nadir points of multiobjective integer programming problems
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2017年 第3期69卷 699-712页
作者: Ozpeynirci, Ozgur Izmir Univ Econ Dept Logist Management Izmir Turkey
In this study, we consider the nadir points of multiobjective integer programming problems. We introduce new properties that restrict the possible locations of the nondominated points necessary for computing the nadir... 详细信息
来源: 评论
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 501卷 1-10页
作者: Huang, Wenqi He, Kun Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China
This paper proposes a four dimensional orthogonal packing and time scheduling problem. The problem differs from the classical packing problems in that the position and orientation of each item in the container can be ... 详细信息
来源: 评论
An improved deterministic local search algorithm for 3-SAT
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-3期329卷 303-313页
作者: Brueggemann, T Kern, W Univ Twente Fac Math Sci Dept Appl Math NL-7500 AE Enschede Netherlands
We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O*(1.473(n)) deterministic algorithm for 3-SAT. (C) 2004 Published by Elsevier B.V.
来源: 评论
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
收藏 引用
INFORMS JOURNAL ON COMPUTING 2015年 第1期27卷 164-177页
作者: Verma, Anurag Buchanan, Austin Butenko, Sergiy Texas A&M Univ College Stn TX 77843 USA
This paper explores techniques for solving the maximum clique and vertex coloring problems on very largescale real-life networks. Because of the size of such networks and the intractability of the considered problems,... 详细信息
来源: 评论
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
收藏 引用
algorithmICA 2005年 第4期43卷 245-273页
作者: Chen, JN Kanj, IA Xia, G Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA DePaul Univ Sch CTI Chicago IL 60604 USA
A sequence of exact algorithms to solve the VERTEX COVER and MAXIMUM INDEPENDENT SET problems have been proposed in the literature. All these algorithms appeal to a very conservative analysis that considers the size o... 详细信息
来源: 评论
A DSATUR-based algorithm for the Equitable Coloring Problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2015年 57卷 41-50页
作者: Mendez-Diaz, Isabel Nasini, Graciela Severin, Daniel Univ Buenos Aires FCEyN Dept Ciencias Computac RA-2160 Buenos Aires DF Argentina Univ Nacl Rosario FCEIA RA-2000 Rosario Santa Fe Argentina Consejo Nacl Invest Cient & Tecn RA-1033 Buenos Aires DF Argentina
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSATUR algorithm for... 详细信息
来源: 评论
Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2011年 第4期49卷 589-606页
作者: Mavrotas, George Figueira, Jose Rui Antoniadis, Alexandros Natl Tech Univ Athens Athens 15780 Greece Inst Super Tecn Dept Engn & Gestao P-2780990 Porto Salvo Portugal
We propose a methodology for obtaining the exact Pareto set of Bi-Objective Multi-Dimensional Knapsack Problems, exploiting the concept of core expansion. The core concept is effectively used in single objective multi... 详细信息
来源: 评论
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem
收藏 引用
TRANSPORTATION SCIENCE 2017年 第1期51卷 250-268页
作者: Cacchiani, Valentina Salazar-Gonzalez, Juan-Jose Univ Bologna DEI I-40126 Bologna Italy Univ La Laguna DMEIO San Cristobal la Laguna 38271 Tenerife Spain
We study an integrated airline scheduling problem for a regional carrier. It integrates three stages of the planning process (i.e., fleet assignment, aircraft routing, and crew pairing) that are typically solved in se... 详细信息
来源: 评论