咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是3091-3100 订阅
排序:
On the approximability of numerical taxonomy (fitting distances by tree metrics)
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第3期28卷 1073-1085页
作者: Agarwala, R Bafna, V Farach, M Paterson, M Thorup, M Rutgers State Univ DIMACS Piscataway NJ 08855 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08855 USA Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Copenhagen Dept Comp Sci DK-2100 Copenhagen O Denmark
We consider the problem of fitting an n x n distance matrix D by a tree metric T. Let epsilon be the distance to the closest tree metric under the L-infinity norm;that is, epsilon = min(T) {parallel to T ? D parallel ... 详细信息
来源: 评论
On dependent randomized rounding algorithms
收藏 引用
OPERATIONS RESEARCH LETTERS 1999年 第3期24卷 105-114页
作者: Bertsimas, D Teo, CP Vohra, R MIT Sloan Sch Management Cambridge MA 02139 USA MIT Ctr Operat Res Cambridge MA 02139 USA Natl Univ Singapore Fac Business Adm Dept Decis Sci Singapore 117548 Singapore Northwestern Univ Dept Managerial Econ & Management Sci Evanston IL USA
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In this paper, we describe a class of roun... 详细信息
来源: 评论
Approximability and nonapproximability results for minimizing total flow time on a single machine
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第4期28卷 1155-1166页
作者: Kellerer, H Tautenhahn, T Woeginger, GJ Graz Univ Inst Stat Okonometrie & Operat Res A-8010 Graz Austria Univ Magdeburg Fak Math D-39016 Magdeburg Germany Graz Tech Univ Inst Math B A-8010 Graz Austria
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total flow time. This problem is well known to be NP-complete, and the best polynomial-time approxi... 详细信息
来源: 评论
The algorithmic aspects of uncrowded hypergraphs
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第1期29卷 201-230页
作者: Bertram-Kretzberg, C Lefmann, H Univ Dortmund Lehrstuhl Informat 2 D-44221 Dortmund Germany
We consider the problem of finding deterministically a large independent set of guaranteed size in a hypergraph on n vertices and with m edges. With respect to the Turan bound, the quality of our solutions is better f... 详细信息
来源: 评论
Optimal on-line algorithms for variable-sized bin covering
收藏 引用
OPERATIONS RESEARCH LETTERS 1999年 第1期25卷 47-50页
作者: Woeginger, GJ Zhang, GC Graz Tech Univ Inst Math B A-8010 Graz Austria Zhejiang Univ Math Inst Hangzhou 310027 Peoples R China
We deal with the variable-sized bin covering problem: Given a list L of items in (0, 1] and a finite collection B of feasible bin sizes, the goal is to select a set of bins with sizes in B and to cover them with the i... 详细信息
来源: 评论
A heuristic algorithm for two-machine re-entrant shop scheduling
收藏 引用
ANNALS OF OPERATIONS RESEARCH 1999年 86卷 417-439页
作者: Drobouchevitch, IG Strusevich, VA Univ Greenwich Sch Comp & Math Sci London SE18 6PF England
This paper considers the problem of sequencing n jobs in a two-machine re-entrant shop with the objective of minimizing the maximum completion time. The shop consists of two machines, M-1 and M-2 , and each job has th... 详细信息
来源: 评论
Approximating quadratic programming with bound and quadratic constraints
收藏 引用
MATHEMATICAL PROGRAMMING 1999年 第2期84卷 219-226页
作者: Ye, YY Univ Iowa Dept Management Sci Iowa City IA 52242 USA
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to bound and (simple) quadratic constraints. Based on several early results, we show that a 4/7-approximate solution can ... 详细信息
来源: 评论
Efficient algorithms for integer programs with two variables per constraint - (Extended abstract)  7th
收藏 引用
7th Annual European Symposium on algorithms (ESA 99)
作者: Bar-Yehuda, R Rawitz, D Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Given a bounded integer program with n variables and m constraints each with 2 variables we present an O(mU) time and O(m) space feasibility algorithm for such integer programs (where U is the maximal variable range s... 详细信息
来源: 评论
Using homogenous weights for approximating the partial cover problem
Using homogenous weights for approximating the partial cover...
收藏 引用
10th Annual ACM-SIAM Symposium on Discrete algorithms
作者: Bar-Yehuda, R Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
In this paper we consider the following natural generalization of two fundamental problems: the Set-Cover problem and the Min-Knapsack problem. We are given an hypergraph, each vertex has a nonnegative weight and each... 详细信息
来源: 评论
approximation algorithms for two-machine flow shop scheduling with batch setup times
收藏 引用
MATHEMATICAL PROGRAMMING 1998年 第1-2期82卷 255-271页
作者: Chen, B Potts, CN Strusevich, VA Univ Southampton Fac Math Studies Southampton S0117 1BJ Hants England Univ Warwick Warwick Business Sch Coventry CV4 7AL W Midlands England Univ Greenwich Sch Comp & Math Sci London SE18 6PF England
In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow... 详细信息
来源: 评论