咨询与建议

限定检索结果

文献类型

  • 129 篇 期刊文献
  • 15 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 103 篇 理学
    • 100 篇 数学
    • 3 篇 物理学
    • 1 篇 地理学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 72 篇 工学
    • 50 篇 计算机科学与技术...
    • 21 篇 软件工程
    • 9 篇 控制科学与工程
    • 6 篇 电气工程
    • 6 篇 信息与通信工程
    • 4 篇 机械工程
    • 3 篇 石油与天然气工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 动力工程及工程热...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 交通运输工程
    • 1 篇 城乡规划学
  • 62 篇 管理学
    • 61 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 5 篇 经济学
    • 4 篇 应用经济学
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 1 篇 医学
    • 1 篇 临床医学
  • 1 篇 军事学

主题

  • 145 篇 polynomial algor...
  • 11 篇 np-completeness
  • 9 篇 computational co...
  • 7 篇 linear programmi...
  • 7 篇 scheduling
  • 6 篇 dynamic programm...
  • 6 篇 complexity
  • 5 篇 approximation al...
  • 5 篇 dichotomy
  • 5 篇 np-hardness
  • 4 篇 np-hard problems
  • 4 篇 integer programm...
  • 4 篇 single machine s...
  • 3 篇 graph algorithms
  • 3 篇 equal processing...
  • 3 篇 bernstein basis
  • 3 篇 quadratic assign...
  • 3 篇 matching
  • 3 篇 numerical stabil...
  • 3 篇 makespan

机构

  • 5 篇 simon fraser uni...
  • 4 篇 univ g dannunzio...
  • 4 篇 univ siena dipar...
  • 3 篇 moscow inst phys...
  • 3 篇 rutgers state un...
  • 2 篇 russian acad sci...
  • 2 篇 univ new brunswi...
  • 2 篇 rutgers state un...
  • 2 篇 lomonosov moscow...
  • 2 篇 adam mickiewicz ...
  • 2 篇 univ victoria de...
  • 2 篇 united inst info...
  • 2 篇 univ magdeburg f...
  • 2 篇 suleiman demirel...
  • 2 篇 netanya acad col...
  • 2 篇 ist dalle molle ...
  • 2 篇 bar ilan univ ra...
  • 2 篇 simon fraser uni...
  • 1 篇 natl res univ hi...
  • 1 篇 univ montpellier...

作者

  • 5 篇 mosca raffaele
  • 5 篇 punnen ap
  • 4 篇 agnetis a
  • 4 篇 hammer pl
  • 4 篇 werner frank
  • 4 篇 feder tomas
  • 4 篇 hell pavol
  • 3 篇 punnen abraham p...
  • 3 篇 arkhipov dmitry ...
  • 3 篇 rotics u
  • 3 篇 gawiejnowicz sta...
  • 3 篇 kobler d
  • 3 篇 lazarev alexande...
  • 3 篇 akgul m
  • 2 篇 boros e
  • 2 篇 cechlárová k
  • 2 篇 ruzika stefan
  • 2 篇 averbakh i
  • 2 篇 monnot jerome
  • 2 篇 levner eugene

语言

  • 122 篇 英文
  • 23 篇 其他
检索条件"主题词=Polynomial algorithms"
145 条 记 录,以下是21-30 订阅
排序:
A polynomial ALGORITHM FOR A ONE MACHINE BATCHING PROBLEM
收藏 引用
OPERATIONS RESEARCH LETTERS 1992年 第4期11卷 213-218页
作者: SHALLCROSS, DF IBM CORP THOMAS J WATSON RES CTRYORKTOWN HTSNY 10598
A problem of batching identical jobs on a single machine is studied. Constant processing times and batch setup times are assumed. An algorithm is presented to minimize the sum over all jobs of the batched completion t... 详细信息
来源: 评论
A polynomial algorithm for one problem of guillotine cutting
收藏 引用
OPERATIONS RESEARCH LETTERS 2007年 第5期35卷 636-644页
作者: Arslanov, M. Z. Suleiman Demirel Univ Inst Problems Informat & Control Alma Ata 050010 Kazakhstan
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectang... 详细信息
来源: 评论
A polynomial cycle canceling algorithm for submodular flows
收藏 引用
MATHEMATICAL PROGRAMMING 1999年 第1期86卷 1-15页
作者: Wallacher, C Zimmerman, UT SAP AG D-69190 Walldorf Germany TU Braunschweig Abt Math Optimierung D-38106 Braunschweig Germany
Submodular flow problems, introduced by Edmonds and Giles [2], generalize network flow problems. Many algorithms for solving network flow problems have been generalized to submodular flow problems (cf. references in F... 详细信息
来源: 评论
A GENUINELY polynomial PRIMAL SIMPLEX ALGORITHM FOR THE ASSIGNMENT PROBLEM
收藏 引用
DISCRETE APPLIED MATHEMATICS 1993年 第2期45卷 93-115页
作者: AKGUL, M Department of Industrial Engineering Bilkent University 06533 Bilkent Ankara Turkey
We present a primal simplex algorithm that solves the assignment problem in 1/2n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,...,n. The algorithm utilizes degeneracy ... 详细信息
来源: 评论
A polynomial ALGORITHM FOR BALANCING ACYCLIC DATA FLOW-GRAPHS
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1992年 第11期41卷 1380-1385页
作者: BOROS, E HAMMER, PL SHAMIR, R RUTGERS STATE UNIV CTR DISCRETE MATH & THEORET COMP SCINEW BRUNSWICKNJ 08903
Data flow machines whose task graphs are acyclic can be transformed into synchronous machines, thereby increasing pipelining and throughput. This is achieved by introducing delays or buffers on certain lines, so that ... 详细信息
来源: 评论
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第11期109卷 582-584页
作者: Detti, Paolo Univ Siena Dipartimento Ingn Informaz I-53100 Siena Italy
A polynomial algorithm for the multiple bounded knapsack problem with divisible item sizes is presented. The complexity of the algorithm is O(n(2) + nm), where n and m are the number of different item sizes and knapsa... 详细信息
来源: 评论
A polynomial ALGORITHM FOR THE [N/M/O, T(IJ) = 1, TREE/CMAX] OPEN SHOP PROBLEM
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1994年 第1期72卷 125-134页
作者: BRASEL, H KLUGE, D WERNER, F TECH UNIV OTTO VONGUERICKE FAK MATHPOB 4120W-3010 MAGDEBURGGERMANY
In this paper we consider the open shop problem with unit processing times and tree constraints among the jobs. The objective is to mimimize the schedule length C(max). The complexity of this problem was open. We pres... 详细信息
来源: 评论
A polynomial ALGORITHM FOR THE 2-PATH PROBLEM FOR SEMICOMPLETE DIGRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1992年 第3期5卷 366-376页
作者: BANGJENSEN, J THOMASSEN, C TECH UNIV DENMARK INST MATHDK-2800 LYNGBYDENMARK
This paper presents polynomially bounded algorithms for finding a cycle through any two prescribed arcs in a semicomplete digraph and for finding a cycle through any two prescribed vertices in a complete k-partite ori... 详细信息
来源: 评论
The stable crews problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2004年 第1-3期140卷 1-17页
作者: Cechlárová, K Ferková, S Safarik Univ Fac Sci Math Inst Kosice 04154 Slovakia Tatra Bankra AS Software Dev Dept IT Div Bratislava 81421 Slovakia
In this paper the classical stable roommates problem is generalized to situations when the two partners in a pair perform different roles. We propose an efficient algorithm to decide the existence of a stable matching... 详细信息
来源: 评论
CONTINUOUS MAXIMIN KNAPSACK-PROBLEMS WITH GLB CONSTRAINTS
收藏 引用
MATHEMATICAL PROGRAMMING 1986年 第1期36卷 114-121页
作者: EISELT, HA 1.Concordia University Montreal Canada
This paper introduces the continuous minimax knapsack problem with generalized lower bound constraints and describes an algorithm that solves this problem in O(n logn) time. We also discuss the related problem with ge... 详细信息
来源: 评论