咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是131-140 订阅
排序:
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING
收藏 引用
International Journal of Foundations of Computer Science 1990年 第3期1卷 185-199页
作者: DANIEL P. BOVET MIRIAM DI IANNI PIERLUIGI CRESCENZI Dipartimento di Matematica Università di Roma “La Sapienza” 00185 Roma Italy Dipartimento di Matematica Università de L’Aquila 67010 L’Aquila Italy
One of the main issues in flow control problems is deadlock of messages caused by a limited amount of resources. In this paper, the problem of predicting whether a deadlock will necessarily occur in a Store-and-Forwar... 详细信息
来源: 评论
ON THE WINDY POSTMAN PROBLEM ON EULERIAN GRAPHS
收藏 引用
MATHEMATICAL PROGRAMMING 1989年 第1期44卷 97-112页
作者: WIN, Z 1.Institut für Mathematik Universit?t Augsburg Memminger Str. 6 8900 Augsburg FR Germany
The Windy Postman Problem (WPP) is defined as follows: Given an undirected connected graphG = (V, E) and costsc ij andc ji for each edgeij ∈E (wherec ij is the cost of traversing edgeij fromi toj), find a windy... 详细信息
来源: 评论
A SEQUENTIAL DUAL SIMPLEX ALGORITHM FOR THE LINEAR ASSIGNMENT PROBLEM
收藏 引用
OPERATIONS RESEARCH LETTERS 1988年 第3期7卷 155-158页
作者: AKGUL, M Dept. of Industrial Engineering Bilkent University P.K. 8 06572 Maltepe Ankara Turkey
We present a sequential dual-simplex algorithm for the linear problem which has the same complexity as the algorithms of Balinski [3,4] and Goldfarb [8]: O( n 2 ) pivots, O( n 2 log n + nm ) time. Our algorithm works ... 详细信息
来源: 评论
AN EXTENSION OF THE KONIG-EGERVARY PROPERTY TO NODE-WEIGHTED BIDIRECTED GRAPHS
收藏 引用
MATHEMATICAL PROGRAMMING 1988年 第3期41卷 375-384页
作者: BOURJOLLY, JM 1.Department of Decision Sciences & Management Information Systems Concordia University Montreal Quebec Canada
Given a bidirected graphG and a vectorb of positive integral node-weights, an integer linear program IP is defined on (G, b). IP generalizes the node packing problem on a node-weighted (undirected) graph in the sense ... 详细信息
来源: 评论
AN O(MN) ALGORITHM FOR REGULAR SET-COVERING PROBLEMS
收藏 引用
THEORETICAL COMPUTER SCIENCE 1987年 第2-3期54卷 237-247页
作者: BERTOLAZZI, P SASSANO, A Instituto di Analisi dei Sistemi e Informatica del CNR I-00185 Roma Italy
A clutter L is a collection of m subsets of a ground set E ( L ) = { x 1 ,…, x n } with the property that, for every pair A i , A j ϵ L , A i is neither contained nor contains A j , A transversal of L is a subset of ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
EFFICIENT SCHEDULING algorithms FOR A SINGLE BATCH PROCESSING MACHINE
收藏 引用
OPERATIONS RESEARCH LETTERS 1986年 第2期5卷 61-65页
作者: IKURA, Y GIMPLE, M PAGOSA SYST INC MENLO PARKCA 94025
Scheduling problems of a batch processing machine are solved by efficient algorithms. On a batch processing machine, multiple jobs can be processed simultaneously in a batch form. We call the number of jobs in the bat... 详细信息
来源: 评论
Scaling: A General Framework
收藏 引用
Optimization 1986年 第2期17卷 209-226页
作者: Akgül, M. North Carolina State University School of Physical and Mathematical Sciences Department of Computer Science United States
Scaling is a general technique used in transforming the complexity of a linear program from pseudopolynomiality to fully polynomiality. This is done by applying a pseudopolynomial algorithm to a polynomial number of s... 详细信息
来源: 评论
A simple but NP-hard Problem of Mixed-discrete Programming and its Solution by Approximate algorithms
收藏 引用
Optimization 1985年 第5期16卷 705-714页
作者: Dempe, S. Technische Hochschule Karl-Marx-Stadt Sektion Mathematik DDR - 9010 PSF 964 Karl-Marx-Stadt Germany
A NP-hard problem (P) of mixed-discrete linear programming is considered which consists in the minimization of a linear objective function subject to a special nonconnected subset of an unbounded polymatroid. For this... 详细信息
来源: 评论
THE TRAVELING SALESMAN PROBLEM IN GRAPHS WITH 3-EDGE CUTSETS
收藏 引用
JOURNAL OF THE ACM 1985年 第2期32卷 383-410页
作者: CORNUEJOLS, G NADDEF, D PULLEYBLANK, W UNIV GRENOBLE 1 INFORMAT & MATH APPL LABF-38041 GRENOBLEFRANCE UNIV GRENOBLE 2 F-38040 GRENOBLEFRANCE UNIV WATERLOO DEPT COMBINATOR & OPTIMIZATWATERLOO N2L 3G1ONTARIOCANADA
This paper analyzes decomposition properties of a graph that, when they occur, permit a polynomial solution of the traveling salesman problem and a description of the traveling salesman polytope by a system of linear ... 详细信息
来源: 评论