咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
On a generalized single machine scheduling problem with time-dependent processing times.
On a generalized single machine scheduling problem with time...
收藏 引用
8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM)
作者: Lazarev, Alexander A. Arkhipov, Dmitry I. Werner, Frank Russian Acad Sci VA Trapeznikov Inst Control Sci Moscow Russia Lomonosov Moscow State Univ Moscow Russia Moscow Inst Phys & Technol Dolgoprudnyi Russia Natl Res Univ Int Lab Decis Choice & Anal Higher Sch Econ Russian Federat Moscow Russia Univ Magdeburg Fac Math Inst Math Optimizat Magdeburg Germany
In this paper a generalized formulation of a classical single machine scheduling problem is considered. A set of n jobs characterized by their release dates, deadlines and a start time-dependent processing time functi... 详细信息
来源: 评论
MATRIX PARTITIONS OF GRAPHS: algorithms AND COMPLEXITY
MATRIX PARTITIONS OF GRAPHS: ALGORITHMS AND COMPLEXITY
收藏 引用
作者: Mayssam Mohammadi Nevisi Simon Fraser University
学位级别:博士
来源: 评论
polynomial algorithms for solving the quadratic assignment problem on networks
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2010年 第11期50卷 1948-1955页
作者: Zabudskii, G. G. Lagzdin, A. Yu. Russian Acad Sci Omsk Branch Sobolev Inst Math Siberian Branch Omsk 644099 Russia
polynomial algorithms for solving the quadratic assignment problem on special types of networks are proposed. The structure of the links between the objects to be located is represented by a graph.
来源: 评论
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 193卷 1-10页
作者: Punnen, Abraham P. Sripratak, Piyashat Karapetyan, Daniel Simon Fraser Univ Surrey Dept Math Cent City Surrey BC V3T 0A3 Canada Chiang Mai Univ Dept Math Fac Sci Chiang Mai 50200 Thailand Univ Nottingham Sch Comp Sci ASAP Res Grp Nottingham NG8 1BB England
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications a... 详细信息
来源: 评论
Finding One Community in a Sparse Graph
收藏 引用
JOURNAL OF STATISTICAL PHYSICS 2015年 第2期161卷 273-299页
作者: Montanari, Andrea Stanford Univ Dept Elect Engn Stanford CA 94305 USA Stanford Univ Dept Stat Stanford CA 94305 USA
We consider a random sparse graph with bounded average degree, in which a subset of vertices has higher connectivity than the background. In particular, the average degree inside this subset of vertices is larger than... 详细信息
来源: 评论
Minimization of maximum lateness with equal processing times for single machine
Minimization of maximum lateness with equal processing times...
收藏 引用
15th IFAC Symposium on Information Control Problems in Manufacturing
作者: Lazarev, Alexander A. Arkhipov, Dmitry I. RAS Inst Control Sci Moscow 117901 Russia Moscow MV Lomonosov State Univ Moscow Russia Moscow Inst Phys & Technol Dolgoprudnyi Russia Natl Res Univ Higher Sch Econ Moscow Russia
The following case of the classical NP-hard scheduling problem is considered. There is a set of jobs N with identical processing times p = const. All jobs have to be processed on a single machine. The objective functi... 详细信息
来源: 评论
Minimization of maximum lateness with equal processing times for single machine ∗
收藏 引用
IFAC-PapersOnLine 2015年 第3期48卷 806-809页
作者: Alexander A. Lazarev Dmitry I. Arkhipov Institute of Control Sciences of RAS Moscow Russian Federation Lomonosov Moscow State University Moscow Russian Federation Moscow Institute of Physics and Technology Dolgoprudny Russian Federation National Research University Higher School of Economics Moscow Russian Federation Institute of Control Sciences of RAS Moscow Russia
The following case of the classical NP-hard scheduling problem is considered. There is a set of jobs N with identical processing times p = const. All jobs have to be processed on a single machine. The objective functi... 详细信息
来源: 评论
Allocating slacks in stochastic PERT network
收藏 引用
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2014年 第1期22卷 37-52页
作者: Castro, Javier Gomez, Daniel Tejada, Juan Univ Complutense Escuela Univ Estadist Dpto Estadist & IO 3 E-28040 Madrid Spain Univ Complutense Fac Matemat Dpto Estadist & IO 1 E-28040 Madrid Spain
The SPERT problem was defined, in a game theory framework, as the fair allocation of the slack or float among the activities in a PERT network previous to the execution of the project. Previous approaches tackle with ... 详细信息
来源: 评论
Isomorphic scheduling problems
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2014年 第1期213卷 131-145页
作者: Gawiejnowicz, Stanislaw Kononov, Alexander Adam Mickiewicz Univ Fac Math & Comp Sci PL-61614 Poznan Poland Sobolev Inst Math Novosibirsk 630090 Russia Novosibirsk State Univ Novosibirsk 630090 Russia
We consider general properties of isomorphic scheduling problems that constitute a new class of pairs of mutually related scheduling problems. Any such a pair is composed of a scheduling problem with fixed job process... 详细信息
来源: 评论
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
收藏 引用
DISCRETE OPTIMIZATION 2013年 第3期10卷 200-209页
作者: Punnen, Abraham P. Kabadi, Santosh N. Simon Fraser Univ Surrey Dept Math Surrey BC V3T 0A3 Canada Univ New Brunswick Fac Business Adm Fredericton NB Canada
An instance of the quadratic assignment problem (QAP) with cost matrix Q is said to be linearizable if there exists an instance of the linear assignment problem (LAP) with cost matrix C such that for each assignment, ... 详细信息
来源: 评论