咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是221-230 订阅
Minimum cycle factors in quasi-transitive digraphs
收藏 引用
DISCRETE OPTIMIZATION 2008年 第1期5卷 121-137页
作者: Bang-Jensen, Jorgen Nielsen, Morten Hegner Univ Winnipeg Dept Math & Stat Winnipeg MB R3B 2E9 Canada Univ So Denmark Dept Math & Comp Sci DK-5230 Odense Denmark
We consider the minimum cycle factor problem: given a digraph D, find the mini mum number k(min)(D) of vertex disjoint cycles covering all vertices of D or verify that D has no cycle factor. There is an analogous prob... 详细信息
来源: 评论
On stochastic lot-sizing problems with random lead times
收藏 引用
OPERATIONS RESEARCH LETTERS 2008年 第3期36卷 303-308页
作者: Huang, Kai Kuecuekyavuz, Simge Tech Univ Eindhoven Dept Technol Management Sub Dept Operat Planning Accounting & Control NL-5600 MB Eindhoven Netherlands Univ Arizona Dept Syst & Ind Engn Tucson AZ 85721 USA
We give multi-stage stochastic programming formulations for lot-sizing problems where costs, demands and order lead times follow a general discrete-time stochastic process with finite support. We characterize the prop... 详细信息
来源: 评论
Performance analysis of a collision detection algorithm of spheres based on slab partitioning
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年 第9期E91A卷 2308-2313页
作者: Imamichi, Takashi Nagamochi, Hiroshi Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
In this paper, we consider a collision detection problem of spheres which asks to detect all pairs of colliding spheres in a set of n spheres located in d-dimensional space. We propose a collision detection algorithm ... 详细信息
来源: 评论
On the complexity of ordered colorings
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2008年 第2期22卷 832-847页
作者: Gupta, Arvind Van den Heuvel, Jan Manuch, Jan Stacho, Ladislav Zhao, Xiaohong Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S4 Canada London Sch Econ Dept Math London WC2A 2AE England Simon Fraser Univ Dept Math Burnaby BC V5A 1S6 Canada
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph theory, e.g., directed graph homomorphis... 详细信息
来源: 评论
Polarity of chordal graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第13期156卷 2469-2479页
作者: Ekim, Tinaz Hell, Pavol Stacho, Juraj de Werra, Dominique Ecole Polytech Fed Lausanne ROSE CH-1015 Lausanne Switzerland Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NP-complete to decide for general graphs. It has bee... 详细信息
来源: 评论
The container problem in bubble-sort graph
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2008年 第4期E91D卷 1003-1009页
作者: Suzuki, Yasuto Kaneko, Keiichi Tokyo Univ Agr & Technol Grad Sch Engn Koganei Tokyo 1848588 Japan
Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubbl... 详细信息
来源: 评论
Incremental approach to computation of elementary siphons for arbitrary simple sequential processes with resources
收藏 引用
IET CONTROL THEORY AND APPLICATIONS 2008年 第2期2卷 168-179页
作者: Chao, D. Y. Natl Chengchi Univ Dept Management & Informat Sci Taipei 11623 Taiwan
Computation of elementary siphons proposed by Li et al. is essential for deadlock control and expensive since complete siphon enumeration of the Petri net is needed, and the number of strict minimal siphons (SMS) grow... 详细信息
来源: 评论
A new large-update interior point algorithm for P*(κ) linear complementarity problems
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2008年 第1期216卷 265-278页
作者: Cho, Gyeong-Mi Dongseo Univ Dept Multimedia Engn Pusan 617716 South Korea
In this paper we propose a new large-update primal-dual interior point algorithm for P-*(kappa) linear complementarity problems (LCPs). We generalize Bai et al.'s [A primal-dual interior-point method for linear op... 详细信息
来源: 评论
The minimum spanning strong subdigraph problem is fixed parameter tractable
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第15期156卷 2924-2929页
作者: Bang-Jensen, Jorgen Yeo, Anders Univ So Denmark Dept Math & Comp Sci DK-5230 Odense Denmark Univ London Dept Comp Sci Egham TW20 0EX Surrey England
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strong subdigraph of a strong... 详细信息
来源: 评论
On the stable b-matching problem in multigraphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第5期156卷 673-684页
作者: Borbel'ova, Viera Cechlarova, Katarina Safarik Univ Fac Sci Inst Math Kosice 04154 Slovakia
This paper deals with the stable b-matching problem in multigraphs, called the stable multiple activities problem, SMA for short. In an SMA instance a multigraph G = (V, E), capacity b(v) and a linear order <(v) on... 详细信息
来源: 评论