咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

  • 13 篇 univ g dannunzio...
  • 7 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 univ rostock ins...
  • 5 篇 zhejiang normal ...
  • 4 篇 univ primorska u...
  • 4 篇 indian inst tech...
  • 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...
  • 9 篇 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

语言

  • 254 篇 英文
  • 31 篇 其他
检索条件"主题词=polynomial time algorithm"
285 条 记 录,以下是221-230 订阅
排序:
Hardness and Approximation Results for Some Variants of Stable Marriage Problem  8th
Hardness and Approximation Results for Some Variants of Stab...
收藏 引用
8th International Conference on algorithms and Discrete Applied Mathematics
作者: Panda, B. S. Sachin Indian Inst Technol Delhi Dept Math New Delhi 110016 India
We study several key variants of SMTI - Stable Marriage problem in which the preference lists may contain ties and may be incomplete. A matching is called weakly stable unless there is a man and a woman such that they... 详细信息
来源: 评论
Reconstruction of binary matrices under adjacency constraints
收藏 引用
Electronic Notes in Discrete Mathematics 2005年 20卷 281-297页
作者: Costa, M.-C. Jarray, F. Picouleau, C. CEDRIC CNAM 75003 Paris 292 rue Saint Martin France CEDRIC CNAM 75003 Paris 292 rue Saint Martin France
We consider a generalization of the classical binary matrix reconstruction problem by considering adjacency constraints between the cells: if a given cell is of value 1 then all its neighbors are of value 0. This prob... 详细信息
来源: 评论
The constrained minimax linear assignment problem
The constrained minimax linear assignment problem
收藏 引用
International Conference on Nonlinear Programming and Variational Inequalities
作者: Charnsethikul, P Kasetsart Univ Dept Ind Engn Operat Res Unit Bangkok Thailand Kasetsart Univ Dept Ind Engn Management Sci Unit Bangkok Thailand
The minimax linear assignment problem with additional linear constraints is studied. An exact polynomial time algorithm is developed, verified and validated in case of a single added constraint. In case of multiple co... 详细信息
来源: 评论
On the Thinness of Trees  7th
On the Thinness of Trees
收藏 引用
7th International Symposium on Combinatorial Optimization (ISCO)
作者: Bonomo-Braberman, Flavia Brandwein, Eric Lucia Gonzalez, Carolina Sansone, Agustin Univ Buenos Aires Fac Ciencias Exactas & Natur Dept Computac Buenos Aires Argentina Univ Buenos Aires Inst Invest Ciencias Computac ICC CONICET Buenos Aires Argentina
The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their algorithmic use has also been increasing [Cygan et al., 2015]. New w... 详细信息
来源: 评论
Inventory replenishment planning with a full truckload cost and a full return policy
Inventory replenishment planning with a full truckload cost ...
收藏 引用
16th IFAC Symposium on Information Control Problems in Manufacturing (INCOM)
作者: Farhat, Mlouka Akbalik, Ayse Sauer, Nathalie Hadj-Alouane, Atidel B. Univ Lorraine LGIPM Technopole F-57073 Metz France Univ Lorraine LCOMS Technopole F-57073 Metz France Univ Tunis El Manar OASIS Ecole Natl Ingenieurs Tunis BP 37 Le Belvedere Tunis 1002 Tunisia
This paper addresses the single-item uncapacitated lot sizing problem with batch ordering under the buyback contract between a retailer and a supplier. The form of this type of contract consists in returning all the u... 详细信息
来源: 评论
On the Recognition of k-Equistable Graphs
On the Recognition of <i>k</i>-Equistable Graphs
收藏 引用
38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
作者: Levit, Vadim E. Milanic, Martin Tankus, David Ariel Univ Ctr Samaria Dept Comp Sci & Math IL-40700 Ariel Israel Univ Primorska UP IAM SI-6000 Koper Slovenia Univ Primorska UP FAMNIT SI-6000 Koper Slovenia
A graph G = (V, E) is called equistable if there exist a positive integer t and a weight function w : V -> N such that S subset of V is a maximal stable set of G if and only if w(S) = t. The function w, if exists, ... 详细信息
来源: 评论
Network Flow Models for Days Off Scheduling  9th
Network Flow Models for Days Off Scheduling
收藏 引用
9th International Conference on Metaheuristics and Nature Inspired Computing (META)
作者: Tlig, Ghassen Jarray, Fethi Ecole Super Elect Ouest Paris France UTM Univ LIMTIC Lab Tunis Tunisia
This paper studies the days off scheduling problem when the demand for staffing may differ from day to another and when the total load is fixed in advance for each employee. The scheduling problem is then to assign on... 详细信息
来源: 评论
Cost-based solution for optimizing multi-join queries over distributed streaming sensor data
Cost-based solution for optimizing multi-join queries over d...
收藏 引用
International Conference on Collaborative Computing
作者: Gomes, Joseph Choi, Hyeong-Ah George Washington Univ Dept Comp Sci Washington DC 20052 USA
Sensors are envisioned to be at the center of distributed collaborative computing services involving time-critical decision support. Sensors are small devices with limited communication and computational capabilities ... 详细信息
来源: 评论
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections
收藏 引用
Electronic Notes in Discrete Mathematics 2005年 20卷 347-363页
作者: Frosini, A. Rinaldi, S. Barcucci, E. Kuba, A. Dipartimento di Scienze Matematiche e Informatiche University of Siena Siena Italy Dipartimento di Sistemi e Informatica University of Florence Florence Italy Dept. of Image Proc. and Computer Graphics Univ. of Szeged Szeged Hungary
This paper studies the classical tomographical problem of the reconstruction of a binary matrix from projections in presence of absorption. In particular, we consider two projections along the horizontal and vertical ... 详细信息
来源: 评论
Reconstruction of Interval Graphs
Reconstruction of Interval Graphs
收藏 引用
15th Annual International Conference on Computing and Combinatorics (COCOON 2009)
作者: Kiyomi, Masashi Saitoh, Toshiki Uehara, Ryuhei JAIST Sch Informat Sci Nomi Ishikawa 9231292 Japan
The graph reconstruction conjecture is a long-standing open problem in graph theory. There are many algorithmic studies related it besides mathematical studies, such as DECK CHECKING, LEGITIMATE DECK, PREIMAGE CONSTRU... 详细信息
来源: 评论