咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=Approximation algorithm"
3229 条 记 录,以下是3061-3070 订阅
排序:
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年 第2期123卷 229-240页
作者: Drobouchevitch, IG Strusevich, VA Univ Greenwich Sch Comp & Math Sci London SE10 9LS England
The paper considers the job shop scheduling problem to minimize the makespan. It is assumed that each job consists of at most two operations, one of which is to be processed on one of m greater than or equal to 2 mach... 详细信息
来源: 评论
A PTAS for minimizing the total weighted completion time on identical parallel machines
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2000年 第1期25卷 63-75页
作者: Skutella, M Woeginger, GJ Tech Univ Berlin Fachbereich Math D-10623 Berlin Germany Graz Univ Technol Inst Math A-8010 Graz Austria
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion limes. This problem is NP-hard in the strong sense. The best approximation re... 详细信息
来源: 评论
Approximating a generalization of MAX 2SAT and MIN 2SAT
收藏 引用
DISCRETE APPLIED MATHEMATICS 2000年 第1-3期107卷 41-59页
作者: Hochbaum, DS Pathria, A Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Univ Calif Berkeley Walter A Haas Sch Business Berkeley CA 94720 USA HNC Software Inc San Diego CA 92121 USA
This payer considers generalized 2SAT problems, MAX GEN2SAT and MIN GEN2SAT. Instances of these problems are defined on a collection of "clauses", which we refer to as genclauses. A genclause is any boolean ... 详细信息
来源: 评论
Scheduling classes on a college campus
收藏 引用
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2000年 第3期16卷 279-294页
作者: Fizzano, P Swanson, S Univ Puget Sound Dept Math & Comp Sci Tacoma WA 98416 USA
We consider the problem of scheduling a set of classes to classrooms with the objective of minimizing the number of classrooms used. The major constraint that we must obey is that no two classes can be assigned to the... 详细信息
来源: 评论
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem
收藏 引用
OPERATIONS RESEARCH LETTERS 2000年 第4期26卷 193-197页
作者: Sviridenko, MI Univ Aarhus Basic Res Inst Comp Sci DK-8000 Aarhus C Denmark Sobolev Inst Math Novosibirsk Russia
In this work we consider the maximum p-facility location problem with k additional resource constraints. We prove that, the simple greedy algorithm has performance guarantee (1 - e(-(k+1)))/(k + 1). In the case k = 0 ... 详细信息
来源: 评论
Approximating multiroot 3-outconnected subgraphs
收藏 引用
NETWORKS 2000年 第3期36卷 172-179页
作者: Nutov, Z Open Univ Israel Ramat Aviv Israel
Consider the following problem: Given an undirected graph with nonnegative edge costs and requirements k(u) for every node u, find a minimum-cost subgraph that contains max{k(u), k(v)} internally disjoint paths betwee... 详细信息
来源: 评论
Quadrangular refinements of convex polygons with an application to finite-element meshes
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2000年 第1期10卷 1-40页
作者: Müller-Hannemann, M Weihe, K Tech Univ Berlin Fachbereich Math Sekr MA 6 1 D-10632 Berlin Germany Univ Konstanz Fak Math & Informat D-78457 Constance Germany
We present a linear-time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterise the polygons that can be decomposed without additional... 详细信息
来源: 评论
Wavelength allocation on trees of rings
收藏 引用
NETWORKS 2000年 第4期35卷 248-252页
作者: Deng, XT Li, GJ Zang, WN Univ Hong Kong Dept Math Hong Kong Hong Kong Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Shandong Univ Dept Math Jinan 250100 Peoples R China
We consider a problem that arises from communication in all-optical networks. Data are transmitted from source nodes to destination nodes via fixed routes. The high bandwidth of the optic fiber allows for wavelength-d... 详细信息
来源: 评论
One for the price of two: a unified approach for approximating covering problems
收藏 引用
algorithmICA 2000年 第2期27卷 131-144页
作者: Bar-Yehuda, R Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
We present a simple and unified approach for developing and analyzing approximation algorithms for covering problems. We illustrate this on approximation algorithms for the following problems: Vertex Cover, Set Cover,... 详细信息
来源: 评论
Approximating fractional multicommodity flow independent of the number of commodities
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2000年 第4期13卷 505-520页
作者: Fleischer, LK Carnegie Mellon Univ Grad Sch Ind Adm Pittsburgh PA 15213 USA Columbia Univ Dept Ind Engn & Operat Res New York NY 10027 USA
We describe fully polynomial time approximation schemes for various multicommodity ow problems in graphs with m edges and n vertices. We present the rst approximation scheme for maximum multicommodity ow that is indep... 详细信息
来源: 评论