咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是301-310 订阅
排序:
The Frobenius problem for classes of polynomial solvability
收藏 引用
MATHEMATICAL NOTES 2001年 第5-6期70卷 771-778页
作者: Kan, ID Moscow MV Lomonosov State Univ Moscow 117234 Russia
The Frobenius problem is to find a method (= algorithm) for calculating the largest "sum of money" that cannot be given by coins whose values b(0), b(1),..., b(w). are coprime integers. As admissible solutio... 详细信息
来源: 评论
Single machine batch scheduling with resource dependent setup and processing times
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2001年 第1期135卷 177-183页
作者: Cheng, TCE Janiak, A Kovalyov, MY Natl Acad Sci Inst Engn Cybernet Minsk 220012 BELARUS Hong Kong Polytech Univ Dept Management Kowloon Hong Kong Peoples R China Wroclaw Univ Technol Inst Engn Cybernet PL-50370 Wroclaw Poland
Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a mach... 详细信息
来源: 评论
A note on α-redundant vertices in graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2001年 第3期108卷 301-308页
作者: Brandstädt, A Lozin, VV Univ Rostock FB Informat D-18051 Rostock Germany Univ Nizhny Novgorod Nizhnii Novgorod 603600 Russia
A vertex v in a graph G is called alpha -redundant if alpha (G - v) = alpha (C), where alpha (G) stands for the stability number of G, i.e. the maximum size of a subset of pairwise nonadjacent vertices. We describe su... 详细信息
来源: 评论
Scheduling batches with simultaneous job processing for two-machine shop problems
收藏 引用
JOURNAL OF SCHEDULING 2001年 第1期4卷 25-51页
作者: Potts, CN Strusevich, VA Tautenhahn, T Univ Southampton Fac Math Studies Southampton SO17 1BJ Hants England Univ Greenwich Sch Comp & Math Sci London SE10 9LS England Otto Von Guericke Univ Fak Math D-39016 Magdeburg Germany
We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined ... 详细信息
来源: 评论
On the complexity of a class of combinatorial optimization problems with uncertainty
收藏 引用
MATHEMATICAL PROGRAMMING 2001年 第2期90卷 263-272页
作者: Averbakh, I Univ Toronto Div Management Scarborough ON M1C 1A4 Canada
We consider a robust (minmax-regret) version of the problem of selecting p elements of minimum total weight out of a set of In elements with uncertainty in weights of the elements. We present a polynomial algorithm wi... 详细信息
来源: 评论
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
收藏 引用
DISCRETE APPLIED MATHEMATICS 2001年 第1-3期114卷 13-22页
作者: Beresnev, VL Sobolev Inst Math Novosibirsk 630090 Russia
The uncapacitated facility location problem is considered in case when the transportation matrix has a totally balanced characteristic matrix. Since this problem is equivalent to the minimization problem of a polynomi... 详细信息
来源: 评论
Minimum cost edge subset covering exactly k vertices of a graph
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2001年 第3期5卷 275-286页
作者: Plesník, J Comenius Univ Fac Math Phys & Informat Dept Numer & Optimizat Methods Bratislava 84248 Slovakia
Given a graph G with nonnegative edge costs and an integer k, we consider the problem of finding an edge subset S of minimum total cost with respect to the constraint that S covers exactly k vertices of G. An O(n(3)) ... 详细信息
来源: 评论
A class of bottleneck expansion problems
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2001年 第6期28卷 505-519页
作者: Zhang, JZ Yang, C Lin, YX City Univ Hong Kong Dept Math Hong Kong Hong Kong Peoples R China Zhengzhou Univ Dept Math Zhengzhou Peoples R China
In this paper we consider how to increase the capacities of the elements in a set E efficiently so that the capacity of a given family F of subsets of E can be increased to the maximum extent while the total cost for ... 详细信息
来源: 评论
The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2001年 第1期41卷 1-19页
作者: Bang-Jensen, J Yeo, A Odense Univ Dept Math & Comp Sci DK-5230 Odense Denmark Aarhus Univ Dept Comp Sci BRICS DK-8000 Aarhus Denmark Univ Victoria Dept Math & Stat Victoria BC V8W 2Y2 Canada
We consider the problem (minimum spanning strong subdigraph (MSSS)) of finding the minimum number of arcs in a spanning strongly connected subdigraph of a strongly connected digraph. This problem is NP-hard for genera... 详细信息
来源: 评论
An efficient algorithm for the ring loading problem with integer demand splitting
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2001年 第3期14卷 291-298页
作者: Myung, YS Dankook Univ Dept Business Adm Cheonan 330714 Chungnam South Korea
In the ring loading problem, traffic. demands are given for each pair of nodes in an undirected ring network and a flow is routed in either of two directions, clockwise and counterclockwise. The load of an edge is the... 详细信息
来源: 评论