咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是3031-3040 订阅
排序:
Approximating the minimum k-way cut in a graph via minimum 3-way cuts
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2001年 第4期5卷 397-410页
作者: Zhao, L Nagamochi, H Ibaraki, T Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
For an edge weighted undirected graph G and an integer k > 2, a k-way cut is a set of edges whose removal leaves G with at least k components. We propose a simple approximation algorithm to the minimum k-way cut pr... 详细信息
来源: 评论
Minimizing makespan on a single batch processing machine with nonidentical job sizes
收藏 引用
NAVAL RESEARCH LOGISTICS 2001年 第3期48卷 226-240页
作者: Zhang, GC Cai, XQ Lee, CY Wong, CK Zhejiang Univ Dept Math Hangzhou 310027 Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Peoples R China Texas A&M Univ Dept Ind Engn College Stn TX 77843 USA Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Peoples R China
We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a numb... 详细信息
来源: 评论
A projected gradient algorithm for solving the maxcut SDP relaxation
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2001年 第3-4期15卷 175-200页
作者: Burer, S Monteiro, RDC Georgia Inst Technol Sch Math Atlanta GA 30332 USA Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA
In this paper, we present a projected gradient algorithm for solving the semidefinite programming (SDP) relaxation of the maximum cut (maxcut) problem. Coupled with a randomized method, this gives a very efficient app... 详细信息
来源: 评论
Tighter bounds on preemptive job shop scheduling with two machines
收藏 引用
COMPUTING 2001年 第1期67卷 83-90页
作者: Anderson, EJ Jayram, TS Kimbrel, T Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA
We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most P-max/12 greater than the optimal ... 详细信息
来源: 评论
Two-stage open shop scheduling with a bottleneck machine
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2001年 第1期128卷 159-174页
作者: Drobouchevitch, IG Strusevich, VA Univ Greenwich Sch Comp & Math Sci London SE10 9LS England
It is known that for the open shop scheduling problem to minimize the makespan there exists no polynomial-time heuristic algorithm that guarantees a worst-case performance ratio better than 5/4, unless P not equal NP.... 详细信息
来源: 评论
On minimum edge ranking spanning trees
收藏 引用
JOURNAL OF algorithmS 2001年 第2期38卷 411-437页
作者: Makino, K Uno, Y Ibaraki, T Univ Osaka Prefecture Coll Integrated Arts & Sci Dept Math & Informat Sci Sakai Osaka 5918531 Japan Osaka Univ Grad Sch Engn Sci Div Syst Sci Toyonaka Osaka 5608531 Japan Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST);i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a giv... 详细信息
来源: 评论
Approximate max-min resource sharing for structured concave optimization
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2001年 第4期11卷 1081-1091页
作者: Grigoriadis, MD Khachiyan, LG Porkolab, L Villavicencio, J Rutgers State Univ Dept Comp Sci New Brunswick NJ 08903 USA Univ London Imperial Coll Sci Technol & Med Dept Comp London England Pontificia Univ Catolica Chile Fac Matemat Santiago Chile
We present a Lagrangian decomposition algorithm which uses logarithmic potential reduction to compute an epsilon -approximate solution of the general max-min resource sharing problem with M nonnegative concave constra... 详细信息
来源: 评论
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
收藏 引用
NETWORKS 2001年 第2期38卷 59-67页
作者: Andreae, T Univ Hamburg Math Seminar D-20146 Hamburg Germany
For a finite set X, let c be a mapping which assigns to every two-element subset {u, v} of X a nonnegative real number c(u, v), the cost of {u, v}. For tau is an element of R, tau greater than or equal to 1, we say th... 详细信息
来源: 评论
A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
收藏 引用
SIAM JOURNAL ON COMPUTING 2001年 第6期30卷 1942-1961页
作者: Jiang, T Kearney, P Li, M Univ Calif Riverside Dept Comp Sci Riverside CA 92521 USA Univ Waterloo Dept Comp Sci Waterloo ON N2L 3G1 Canada
Inferring evolutionary trees has long been a challenging problem for both biologists and computer scientists. In recent years research has concentrated on the quartet method paradigm for inferring evolutionary trees. ... 详细信息
来源: 评论
Upgrading bottleneck constrained forests  24th
Upgrading bottleneck constrained forests
收藏 引用
24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98)
作者: Krumke, SO Marathe, MV Noltemeier, H Ravi, SS Wirth, HC Univ Wurzburg Dept Comp Sci D-97074 Wurzburg Germany Konrad Zuse Zentrum Informat Tech Berlin Dept Optimizat D-14195 Berlin Germany Univ Calif Los Alamos Natl Lab Los Alamos NM 87545 USA SUNY Albany Dept Comp Sci Albany NY 12222 USA
We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V,E) where node nu is an element of V can be upgraded at a cost of c(nu). This upgrade reduces the delay of each lin... 详细信息
来源: 评论