咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Single machine common flow allowance scheduling with a rate-modifying activity
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2010年 第4期59卷 898-902页
作者: Wang, Xiao-Yuan Wang, Ming-Zheng Shenyang Aerosp Univ Sch Sci Shenyang 110136 Peoples R China Dalian Univ Technol Sch Management Dalian 116024 Peoples R China
In this paper we consider single machine SLK due date assignment scheduling problem with a rate-modifying activity. In this model, the machine has a rate-modifying activity that can change the processing rate of machi... 详细信息
来源: 评论
The m-machine flowshop problem with unit-time operations and intree precedence constraints
收藏 引用
OPERATIONS RESEARCH LETTERS 2005年 第3期33卷 263-266页
作者: Averbakh, I Berman, O Chernykh, I Univ Toronto Div Management Scarborough ON M1C 1A4 Canada Univ Toronto Rotman Sch Management Toronto ON M5S 3E6 Canada
We consider the flowshop problem with unit-time operations and intree precedence constraints, with the objective to minimize the total completion time. We present a polynomial-time algorithm assuming that the number o... 详细信息
来源: 评论
ON THE AVERAGE LENGTH OF LEXICOGRAPHIC PATHS
收藏 引用
MATHEMATICAL PROGRAMMING 1986年 第3期35卷 362-364页
作者: BALINSKI, ML LIEBLING, TM NOBS, AE SUNY STONY BROOK DEPT APPL MATHSTONY BROOKNY 11794 ECOLE POLYTECH FED LAUSANNE DEPT MATHCH-1007 LAUSANNESWITZERLAND
A bound is given for the average length of a ‘lexicographic path’, a definition that is motivated by degeneracies encountered when using the randomized simplex method.
来源: 评论
FINDING MINIMUM DOMINATING CYCLES IN PERMUTATION GRAPHS
收藏 引用
OPERATIONS RESEARCH LETTERS 1985年 第1期4卷 13-17页
作者: COLBOURN, CJ KEIL, JM STEWART, LK UNIV SASKATCHEWAN DEPT COMPUTAT SCI SASKATOON S7N 0W0 SASKATCHEWAN CANADA UNIV TORONTO DEPT COMP SCI TORONTO M5S 1A1 ONTARIO CANADA
A dominating cycle for a graph G = ( V , E ) is a subset C of V which has the following properties: (i) the subgraph of G induced by C has a Hamiltonian cycle, and (ii) every vertex of V is adjacent to some vertex of ... 详细信息
来源: 评论
Minmax p-traveling salesmen location problems on a tree
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2002年 第1-4期110卷 55-68页
作者: Averbakh, I Berman, O Univ Toronto Div Management Scarborough ON M1C 1A4 Canada Univ Toronto Rotman Sch Management Toronto ON M5S 3E6 Canada
Suppose that p traveling salesmen must visit together all points of a tree, and the objective is to minimize the maximum of the lengths of their tours. The location-allocation version of the problem (where both optima... 详细信息
来源: 评论
Computing all small cuts in an undirected network
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1997年 第3期10卷 469-481页
作者: Nagamochi, H Nishimura, K Ibaraki, T TOYOTA MOTOR CO LTD SHIZUOKA 41011 JAPAN
Let lambda(N) denote the weight of a minimum cut in an edge-weighted undirected network N, and n and m denote the numbers of vertices and edges, respectively. It is known that O(n(2k)) is upper bound on the number of ... 详细信息
来源: 评论
A TECHNIQUE FOR SPEEDING-UP THE SOLUTION OF THE LAGRANGEAN DUAL
收藏 引用
MATHEMATICAL PROGRAMMING 1994年 第1期63卷 23-45页
作者: BERTSIMAS, D ORLIN, JB MIT ALFRED P SLOAN SCH MANAGEMENTE53-35950 MEM DRCAMBRIDGEMA 02139 USA
We propose techniques for the solution of the LP relaxation and the Lagrangean dual in combinatorial optimization and nonlinear programming problems. Our techniques find the optimal solution value and the optimal dual... 详细信息
来源: 评论
Splitting trees
收藏 引用
DISCRETE MATHEMATICS 1997年 165卷 403-419页
作者: Hansen, P Hertz, A Quinodoz, N ECOLE HAUTES ETUD COMMERCIALES GERADMONTREALPQCANADA ECOLE POLYTECH FED LAUSANNE DEPT MATHLAUSANNESWITZERLAND
Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simultaneously splitting each of its non-trivial trees. The split... 详细信息
来源: 评论
A SUCCESSFUL algorithm FOR SOLVING DIRECTED HAMILTONIAN PATH PROBLEMS
收藏 引用
OPERATIONS RESEARCH LETTERS 1984年 第1期3卷 35-42页
作者: THOMPSON, GL SINGHAL, S Management Science Research Group Graduate School of Industrial Administration Carnegie-Mellon University Pittsburgh PA 15213 USA
In this paper we present a graph-theoretic polynomial algorithm which has positive probability of finding a Hamiltonian path in a given graph, if there is one; if the algorithm fails, it can be rerun with a randomly c... 详细信息
来源: 评论
Maximum weight stable set in (P7, bull)-free graphs and (S1,2,3, bull)-free graphs
收藏 引用
DISCRETE MATHEMATICS 2018年 第5期341卷 1449-1458页
作者: Maffray, Frederic Pastor, Lucas CNRS Paris France Univ Grenoble Alpes Lab G SCOP Grenoble France
We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be... 详细信息
来源: 评论