咨询与建议

限定检索结果

文献类型

  • 385 篇 期刊文献
  • 27 篇 会议
  • 4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 299 篇 理学
    • 294 篇 数学
    • 12 篇 统计学(可授理学、...
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 1 篇 物理学
  • 184 篇 工学
    • 124 篇 计算机科学与技术...
    • 44 篇 软件工程
    • 27 篇 控制科学与工程
    • 18 篇 电气工程
    • 14 篇 机械工程
    • 8 篇 信息与通信工程
    • 5 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 电子科学与技术(可...
    • 3 篇 石油与天然气工程
    • 2 篇 化学工程与技术
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 151 篇 管理学
    • 148 篇 管理科学与工程(可...
    • 16 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 16 篇 经济学
    • 13 篇 应用经济学
    • 3 篇 理论经济学
  • 7 篇 教育学
    • 7 篇 心理学(可授教育学...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 416 篇 polynomial algor...
  • 37 篇 complexity
  • 27 篇 scheduling
  • 17 篇 np-completeness
  • 15 篇 linear programmi...
  • 13 篇 dynamic programm...
  • 12 篇 np-complete
  • 11 篇 computational co...
  • 11 篇 combinatorial op...
  • 10 篇 stable set
  • 10 篇 kernel function
  • 9 篇 np-hardness
  • 8 篇 graph
  • 8 篇 matching
  • 7 篇 graphs
  • 7 篇 tree
  • 6 篇 longest path pro...
  • 6 篇 interior-point m...
  • 6 篇 independent set
  • 6 篇 hamiltonian cycl...

机构

  • 9 篇 univ southern de...
  • 8 篇 rutgers state un...
  • 8 篇 pusan natl univ ...
  • 6 篇 dongseo univ dep...
  • 5 篇 univ so denmark ...
  • 5 篇 univ southern de...
  • 5 篇 univ toronto div...
  • 5 篇 univ nizhny novg...
  • 4 篇 univ paris 09 la...
  • 4 篇 inst engn cybern...
  • 4 篇 kyoto univ grad ...
  • 4 篇 univ johannesbur...
  • 4 篇 belarusian state...
  • 4 篇 univ ioannina de...
  • 3 篇 beijing inst tec...
  • 3 篇 odense univ dept...
  • 3 篇 moscow mv lomono...
  • 3 篇 lomonosov moscow...
  • 3 篇 univ primorska u...
  • 3 篇 eotvos lorand un...

作者

  • 13 篇 lozin vv
  • 11 篇 bang-jensen jorg...
  • 9 篇 nagamochi h
  • 8 篇 mertzios george ...
  • 8 篇 cho gyeong-mi
  • 7 篇 ibaraki t
  • 7 篇 hansen p
  • 6 篇 averbakh igor
  • 6 篇 jaumard b
  • 6 篇 bang-jensen j.
  • 6 篇 bang-jensen j
  • 6 篇 gerber mu
  • 5 篇 hertz a
  • 5 篇 averbakh i
  • 5 篇 levner eugene
  • 5 篇 yeo anders
  • 5 篇 woeginger gj
  • 4 篇 tao yuegang
  • 4 篇 tuza z
  • 4 篇 chu chengbin

语言

  • 336 篇 英文
  • 77 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=polynomial algorithm"
416 条 记 录,以下是241-250 订阅
A note on the computational complexity of graph vertex partition
收藏 引用
DISCRETE APPLIED MATHEMATICS 2007年 第3期155卷 405-409页
作者: Huang, Yuanqiu Chub, Yuming Hunan Normal Univ Dept Math Changsha 410081 Peoples R China Huzhou Teacher Coll Dept Math Zhejiang 313000 Peoples R China
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstadt, V.B. Le, T. Szymczak. The complexity of some problems related to graph 3-colorability, Discrete Appl... 详细信息
来源: 评论
On the optimum capacity of capacity expansion problems
收藏 引用
MATHEMATICAL METHODS OF OPERATIONS RESEARCH 2007年 第2期66卷 225-233页
作者: Yang, Chao Hao, Chunyan Zhang, Jianzhong Huazhong Univ Sci & Technol Coll Management Wuhan 430074 Peoples R China City Univ Hong Kong Dept Math Hong Kong Hong Kong Peoples R China
In this paper we consider problems of the following type: Let E = {e(1), e(2),..., e(n)} be a finite set and F be a family of subsets of E. For each element e(i) in E, c(i) is a given capacity and w(i) is the cost of ... 详细信息
来源: 评论
An efficient solution to cyclic scheduling of a no-wait reentrant serial-parallel PCB production line
An efficient solution to cyclic scheduling of a no-wait reen...
收藏 引用
14th International Conference on Management Science and Engineering
作者: Che A-da Chu Cheng-bin Northwestern Polytech Univ Sch Management Xian 710072 Shaanxi Peoples R China Univ Technol Troyes Inst Charles Delaunay F-10010 Troyes France
The manufacturing of printed. circuit boards (PCB) involves multi-stage production lines where material. handling is performed by a computer-controlled hoist. This paper addresses cyclic scheduling of a no-wait reentr... 详细信息
来源: 评论
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2006年 第3期355卷 389-395页
作者: Bazgan, C Tuza, Z Vanderpooten, D Univ Paris 09 LAMSADE F-75775 Paris 16 France Hungarian Acad Sci Inst Comp & Automat H-1111 Budapest Hungary Univ Veszprem Dept Comp Sci H-8201 Veszprem Hungary
We study the problem of decomposing the vertex set V of a graph into two nonempty parts V-1, V-2 which induce subgraphs where each vertex nu is an element of V-1 has degree at least a (nu) inside nu(1) and each nu is ... 详细信息
来源: 评论
Edge ranking of weighted trees
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第8期154卷 1198-1209页
作者: Dereniowski, D Gdansk Univ Technol Dept Algorithms & Syst Modeling PL-80952 Gdansk Poland
In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking Of multitrees is NP-hard already for multitrees with diameter at most 10. Not... 详细信息
来源: 评论
A new large-update interior point algorithm for P*(κ) LCPs based on kernel functions
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2006年 第2期182卷 1169-1183页
作者: Cho, Gyeong-Mi Kim, Min-Kyung Dongseo Univ Div Comp & Informat Engn Dept Multimedia Engn Pusan 617716 South Korea Pusan Natl Univ Dept Math Pusan 609735 South Korea
In this paper we propose a new large-update primal-dual interior point algorithm for P,,(K) linear complementarity problems (LCPs). Recently, Peng et al. introduced self-regular barrier functions for primal-dual inter... 详细信息
来源: 评论
The competitive salesman problem on a network: a worst-case approach
收藏 引用
OPERATIONS RESEARCH LETTERS 2006年 第2期34卷 165-174页
作者: Averbakh, I Lebedev, V Univ Toronto Div Management Scarborough ON M1C 1A4 Canada Volgograd State Univ Dept Math Volgograd 400062 Russia
We provide a complexity analysis of the problem of optimal routing of a server on a transportation network in the presence of a competing server. The server that reaches a node first gets the profit from the node. The... 详细信息
来源: 评论
ON THE BOTTLENECK CAPACITY EXPANSION PROBLEMS ON NETWORKS
收藏 引用
Acta Mathematica Scientia 2006年 第2期26卷 202-208页
作者: 杨超 张建中 College of Management Department of Mathematics City University of Hong Kong Hong KongChina
This article considers a class of bottleneck capacity expansion problems. Such problems aim to enhance bottleneck capacity to a certain level with minimum cost. Given a network G(V,A,C^-) consisting of a set of node... 详细信息
来源: 评论
Lifting of solutions of an exponential congruence
收藏 引用
MATHEMATICAL NOTES 2006年 第1-2期80卷 72-82页
作者: Popovyan, I. A. Moscow MV Lomonosov State Univ Moscow 117234 Russia
In the present paper, a polynomial algorithm is suggested for reducing the problem of taking the discrete logarithm in the ring of algebraic integers modulo a power of a prime ideal to a similar problem with the power... 详细信息
来源: 评论
Finding blocks and other patterns in a random coloring of Z
收藏 引用
RANDOM STRUCTURES & algorithmS 2006年 第1期28卷 37-75页
作者: Matzinger, H Rolles, SWW Georgia Inst Technol Sch Math Atlanta GA 30332 USA Univ Bielefeld Dept Math D-33501 Bielefeld Germany
Let xi := (xi(k))(k is an element of Z) be i.i.d. with P(xi(k) = 0) = P(xi(k) = 1) = 1/2, and let S := (S-k)(k is an element of N0) be a symmetric random walk with holding on Z, independent of. We consider the scenery... 详细信息
来源: 评论