咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 414 篇 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

语言

  • 334 篇 英文
  • 77 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=Polynomial algorithm"
414 条 记 录,以下是181-190 订阅
排序:
A continuous network location problem for a single refueling station on a tree
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2015年 62卷 257-265页
作者: Ventura, Jose A. Hwang, Seong Wook Kweon, Sang Jin Penn State Univ Harold & Inge Marcus Dept Ind & Mfg Engn University Pk PA 16802 USA
This article considers the continuous version of the refueling station location problem on a tree network, which is a common structure in numerous toll roads worldwide, so as to locate a single alternative-fuel refuel... 详细信息
来源: 评论
Log-barrier method for two-stage quadratic stochastic programming
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2005年 第1期164卷 45-69页
作者: Cho, GM Dongseo Univ Div Internet Engn Pusan 617716 South Korea
In this paper we present a log-barrier method for solving two-stage quadratic stochastic programs. The mathematical model considered here can be used to present several real world applications, including financial and... 详细信息
来源: 评论
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 234卷 210-217页
作者: Furmanczyk, Hanna Kubale, Marek Univ Gdansk Inst Informat Wita Stwosza 57 PL-80952 Gdansk Poland Gdansk Univ Technol Fac Elect Telecommun & Informat Narutowicza 11-12 PL-80233 Gdansk Poland
In the paper we consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s(1),s(2), and s(3) to minimize the ***. We assume that jobs are subjected to some kind of mutual exclusion constra... 详细信息
来源: 评论
Decreasing minimization on M-convex sets: algorithms and applications
收藏 引用
MATHEMATICAL PROGRAMMING 2022年 第1-2期195卷 1027-1068页
作者: Frank, Andras Murota, Kazuo Eotvos Lorand Univ Dept Operat Res MTA ELTE Egervary Res Grp Pazmany P S 1-C H-1117 Budapest Hungary Tokyo Metropolitan Univ Dept Econ & Business Adm Tokyo 1920397 Japan Inst Stat Math Tokyo 1908562 Japan
This paper is concerned with algorithms and applications of decreasing minimization on an M-convex set, which is the set of integral elements of an integral base-polyhedron. Based on a recent characterization of decre... 详细信息
来源: 评论
Bayesian Recognition Procedures on Networks
收藏 引用
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES 2010年 第11期42卷 58-63页
作者: Vagis, A. A. Natl Acad Sci Ukraine VM Glushkov Cybernet Inst Kiev Ukraine
The polynomial algorithms of determining Bayesian network structure are described as "tree" or "polytree". In the known Bayesian network structure consideration is given to Bayesian recognition pro... 详细信息
来源: 评论
Packing triangles in bounded degree graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第4期84卷 175-180页
作者: Caprara, A Rizzi, R Univ Bologna DEIS I-40136 Bologna Italy Aarhus Univ BRICS Ctr Danish Natl Res Fdn DK-8000 Aarhus C Denmark Aarhus Univ Dept Comp Sci DK-8000 Aarhus C Denmark
We consider the two problems of finding the maximum number of node disjoint triangles and edge disjoint triangles in an undirected graph. We show that the first (respectively second) problem is polynomially solvable i... 详细信息
来源: 评论
The Ck-extended graft construction
收藏 引用
DISCRETE APPLIED MATHEMATICS 2011年 第12期159卷 1293-1301页
作者: MacGillivray, Gary Swarts, Jacobus Vancouver Isl Univ Dept Math Nanaimo BC V9R 5S5 Canada Univ Victoria Victoria BC V8W 3R4 Canada
Gutjahr, Welzl and Woeginger found polynomial-time algorithms for a number of digraph homomorphism problems. These algorithms are based on the (X) under bar -enumeration, the C-k-extended (X) under bar -enumeration an... 详细信息
来源: 评论
Out-colourings of digraphs
收藏 引用
JOURNAL OF GRAPH THEORY 2020年 第1期93卷 88-112页
作者: Alon, Noga Bang-Jensen, Jorgen Bessy, Stephane Princeton Univ Dept Math Princeton NJ 08544 USA Tel Aviv Univ Sch Math Tel Aviv Israel Tel Aviv Univ Sch Comp Sci Tel Aviv Israel Univ Southern Denmark Dept Math & Comp Sci Odense Denmark Univ Montpellier Dept Comp Sci LIRMM F-34000 Montpellier France CNRS F-34000 Montpellier France
We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring. The problem of deciding whether a given digraph has an out-colouring with only two colou... 详细信息
来源: 评论
An algorithm for source location in directed graphs
收藏 引用
OPERATIONS RESEARCH LETTERS 2005年 第3期33卷 221-230页
作者: Bárász, M Becker, J Frank, A Eotvos Lorand Univ Dept Operat Res H-1117 Budapest Hungary
A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D = (V, A) such that, for every node v is an element of V - R, there are k edge-disjoint paths from R to v and... 详细信息
来源: 评论
Efficient algorithms for decomposing graphs under degree constraints
收藏 引用
DISCRETE APPLIED MATHEMATICS 2007年 第8期155卷 979-988页
作者: Bazgan, Cristina Tuza, Zsolt Vanderpooten, Daniel Univ Paris 09 LAMSADE F-75775 Paris 16 France Hungarian Acad Sci Inst Comp & Automat Budapest Hungary Univ Pannonia Dept Comp Sci Veszprem Hungary
Stiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321-324] proved that if every vertex v in a graph G has degree d (v) >= a (v) + b(v) + I (where a and b are arbitrarily given nonnega... 详细信息
来源: 评论