咨询与建议

限定检索结果

文献类型

  • 240 篇 期刊文献
  • 43 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 165 篇 理学
    • 164 篇 数学
    • 3 篇 系统科学
    • 2 篇 生物学
    • 2 篇 统计学(可授理学、...
  • 165 篇 工学
    • 130 篇 计算机科学与技术...
    • 30 篇 电气工程
    • 26 篇 软件工程
    • 15 篇 电子科学与技术(可...
    • 9 篇 机械工程
    • 9 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 3 篇 石油与天然气工程
    • 2 篇 动力工程及工程热...
    • 2 篇 交通运输工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
  • 88 篇 管理学
    • 88 篇 管理科学与工程(可...
    • 19 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 19 篇 经济学
    • 17 篇 应用经济学
    • 2 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 2 篇 医学
    • 2 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 2 篇 军事学
  • 1 篇 农学

主题

  • 283 篇 polynomial time ...
  • 21 篇 np-complete
  • 19 篇 computational co...
  • 17 篇 scheduling
  • 13 篇 approximation al...
  • 12 篇 domination
  • 12 篇 np-completeness
  • 11 篇 combinatorial op...
  • 7 篇 np-hard
  • 7 篇 discrete tomogra...
  • 7 篇 complexity
  • 6 篇 efficient edge d...
  • 6 篇 traveling salesm...
  • 6 篇 graph algorithms
  • 6 篇 dynamic programm...
  • 6 篇 dominating induc...
  • 5 篇 interval graphs
  • 5 篇 shortest path
  • 5 篇 np-hardness
  • 4 篇 maximum flow

机构

  • 13 篇 univ g dannunzio...
  • 7 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 indian inst tech...
  • 5 篇 univ rostock ins...
  • 5 篇 zhejiang normal ...
  • 4 篇 univ primorska u...
  • 4 篇 univ primorska u...
  • 3 篇 lanzhou univ sch...
  • 3 篇 univ debrecen in...
  • 3 篇 simon fraser uni...
  • 3 篇 jaist sch inform...
  • 3 篇 kyushu int univ ...
  • 3 篇 kyushu univ dept...
  • 3 篇 univ victoria de...
  • 3 篇 univ warwick war...
  • 3 篇 hiroshima city u...
  • 3 篇 xinjiang univ co...
  • 2 篇 univ calif berke...
  • 2 篇 w virginia univ ...

作者

  • 15 篇 mosca raffaele
  • 12 篇 brandstaedt andr...
  • 10 篇 pradhan d.
  • 8 篇 akbalik ayse
  • 6 篇 rapine christoph...
  • 6 篇 uehara ryuhei
  • 6 篇 milanic martin
  • 6 篇 panda b. s.
  • 6 篇 woeginger gj
  • 5 篇 zhang zhao
  • 5 篇 saitoh toshiki
  • 5 篇 banerjee s.
  • 5 篇 shoudai takayosh...
  • 4 篇 suzuki yusuke
  • 4 篇 frosini a.
  • 4 篇 huang jing
  • 4 篇 kiyomi masashi
  • 4 篇 penz bernard
  • 4 篇 uchida tomoyuki
  • 4 篇 jarray fethi

语言

  • 251 篇 英文
  • 32 篇 其他
检索条件"主题词=polynomial time algorithm"
283 条 记 录,以下是211-220 订阅
排序:
Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年 第1期157卷 257-261页
作者: Mosheiov, G Yovel, U Hebrew Univ Jerusalem Sch Business Adm IL-91905 Jerusalem Israel Hebrew Univ Jerusalem Dept Stat IL-91905 Jerusalem Israel Hebrew Univ Jerusalem Dept Comp Sci IL-91904 Jerusalem Israel
A recent paper [Eur. J. Operat. Res. 127 (2000) 120] addresses a flow-shop scheduling problem, where (i) each of the it jobs is limited to at most two operations, and (ii) one of these operations is common for all the... 详细信息
来源: 评论
Energy Efficient Delivery of Immersive Video Centric Services
Energy Efficient Delivery of Immersive Video Centric Service...
收藏 引用
IEEE INFOCOM Conference
作者: Llorca, Jaime Guan, Kyle Atkinson, Gary Kilper, Daniel C. Alcatel Lucent Bell Labs Holmdel NJ 07733 USA
We examine the basic energy tradeoffs between video transport and video processing for services such as multi-view video (MVV) streaming, where multiple media streams are combined and processed to create an immersive ... 详细信息
来源: 评论
Reconstructing a binary matrix under timetabling constraints
收藏 引用
Electronic Notes in Discrete Mathematics 2005年 20卷 99-112页
作者: Picouleau, C. Brunetti, S. Frosini, A. CEDRIC CNAM 75003 Paris 292 rue Saint Martin France Department of Mathematics Roberto Magari University of Siena 53100 Siena Pian dei Mantellini 44 Italy
Our focus is on the problem of reconstructing a m × n binary matrix M from its vertical and horizontal projections when the following additional constraints have to be satisfied: given an integer k ≥ 2, if Mi j ... 详细信息
来源: 评论
Routing and Scheduling Problems with Two Agents on a Line-Shaped Network  1
收藏 引用
15th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Yan, Hao Lu, Xiwen East China Univ Sci & Technol Dept Math Shanghai 200237 Peoples R China
We consider routing and scheduling problems with two agents on a line-shaped network in this paper. There are two agents and each agent has some jobs which are located in the network. Let L = (V, E) be a line-shaped n... 详细信息
来源: 评论
The Complexity and algorithm for Minimum Expense Spanning Trees
The Complexity and Algorithm for Minimum Expense Spanning Tr...
收藏 引用
International Workshop on Information and Electronics Engineering (IWIEE) / International Conference on Information, Computing and Telecommunications (ICICT)
作者: Zhan Ning Wu Longshu China Jiliang Univ Coll Sci Hangzhou 310018 Peoples R China Xinyang Vocat & Tech Coll Math & Comp Sci Dept Xinyang 464000 Peoples R China
The minimum spanning tree problem is a classical and well-known combinatorial optimization problem. There exist many efficient algorithms such as the Kruskal algorithm and Prim algorithm to solve it. But in a real net... 详细信息
来源: 评论
The Volume of a Crosspolytope Truncated by a Halfspace  1
收藏 引用
15th Annual Conference on Theory and Applications of Models of Computation (TAMC)
作者: Ando, Ei Tsuchiya, Shoichi Senshu Univ Tama Ku 2-1-1 Higashi Mita Kawasaki Kanagawa 2148580 Japan
In this paper, we consider the computation of the volume of an n-dimensional crosspolytope truncated by a halfspace. Since a crosspolytope has exponentially many facets, we cannot efficiently compute the volume by div... 详细信息
来源: 评论
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING timeS AND COMPRESSION COSTS (PART I:EQUAL timeS AND COSTS)
收藏 引用
Applied Mathematics(A Journal of Chinese Universities) 1998年 第4期13卷 417-426页
作者: TANGGUOCHUN FOULDS,L.R. DepartmentofManagement ShanghaiSecondPolytechncUniversityShanghai200002. DepartmentofManagementSystems UniversityofWaikatoHamiltonNewZealand
Abstract Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by reallocating resources. In ... 详细信息
来源: 评论
Finding gale strings
收藏 引用
Electronic Notes in Discrete Mathematics 2010年 第C期36卷 1065-1072页
作者: Casetti, Marta M. Merschen, Julian von Stengel, Bernhard Dept. of Mathematics London School of Economics London WC2A 2AE United Kingdom
The problem 2-. Nash of finding a Nash equilibrium of a bimatrix game belongs to the complexity class PPAD. This class comprises computational problems that are known to have a solution by means of a path-following ar... 详细信息
来源: 评论
Solving Some Instances of the 2-Color Problem
Solving Some Instances of the 2-Color Problem
收藏 引用
15th International Conference on Discrete Geometry for Computer Imagery
作者: Brocchi, S. Frosini, A. Rinaldi, S. Univ Florence Dipartimento Sistemi & Informat Florence Italy Univ Siena Dept Sci Math & Informat Siena Italy
In the held of Discrete Tomography, the 2-color problem consists in determining a matrix whose elements are of two different types, starting from its horizontal and vertical projections. It is known that the one color... 详细信息
来源: 评论
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l-norm  15th
Capacitated Partial Inverse Maximum Spanning Tree Under the ...
收藏 引用
15th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Li, Xianyue Yang, Ruowang Zhang, Heping Zhang, Zhao Lanzhou Univ Sch Math & Stat Lanzhou 730000 Gansu Peoples R China Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Zhejiang Peoples R China
Given an edge weighted graph, and an acyclic edge set, the goal of the partial inverse maximum spanning tree problem is to modify the weight function as small as possible such that there exists a maximum spanning tree... 详细信息
来源: 评论