咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 284 篇 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 篇 graph algorithms
  • 6 篇 dynamic programm...
  • 6 篇 dominating induc...
  • 5 篇 traveling salesm...
  • 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

语言

  • 253 篇 英文
  • 29 篇 其他
检索条件"主题词=Polynomial Time Algorithm"
284 条 记 录,以下是91-100 订阅
排序:
Partial inverse maximum spanning tree in which weight can only be decreased under lp-norm
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2018年 第3期70卷 677-685页
作者: Li, Xianyue Zhang, Zhao Du, Ding-Zhu 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 Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
The maximum or minimum spanning tree problem is a classical combinatorial optimization problem. In this paper, we consider the partial inverse maximum spanning tree problem in which the weight function can only be dec... 详细信息
来源: 评论
polynomial time Learnability of Graph Pattern Languages Defined by Cographs
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2018年 第3期E101D卷 582-592页
作者: Shoudai, Takayoshi Yoshimura, Yuta Suzuki, Yusuke Uchida, Tomoyuki Miyahara, Tetsuhiro Kyushu Int Univ Fac Contemporary Business Kitakyushu Fukuoka 8058512 Japan Kyushu Univ Dept Informat Fukuoka 8190395 Japan Hiroshima City Univ Fac Informat Sci Hiroshima 7313194 Japan Fujitsu Kyushu Syst Serv Ltd CAE Solut Dept Engn Solut Unit Fukuoka Japan
A cograph (complement reducible graph) is a graph which can be generated by disjoint union and complement operations on graphs, starting with a single vertex graph. Cographs arise in many areas of computer science and... 详细信息
来源: 评论
Computing Explicit Isomorphisms with Full Matrix Algebras over Fq (x)
收藏 引用
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS 2018年 第2期18卷 381-397页
作者: Ivanyos, Gabor Kutas, Peter Ronyai, Lajos Hungarian Acad Sci Inst Comp Sci & Control Budapest Hungary Cent European Univ Dept Math & Its Applicat Budapest Hungary Budapest Univ Technol & Econ Dept Algebra Budapest Hungary
We propose a polynomial time f-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over ) for computing an isomorphism (if there is any) of a finite-dimensional -algebra give... 详细信息
来源: 评论
The complexity of the equation solvability problem over nilpotent groups
收藏 引用
JOURNAL OF ALGEBRA 2018年 495卷 289-303页
作者: Foldvari, Attila Univ Debrecen Inst Math Pf 400 H-4002 Debrecen Hungary
Let G be a finite, nilpotent group. The computational complexity of the equation solvability problem over G is known to be in P. The complexity is understood in the length of the equation over G. So far the fastest al... 详细信息
来源: 评论
Capacity acquisition for the single-item lot sizing problem under energy constraints
收藏 引用
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2018年 81卷 112-122页
作者: Rapine, Christophe Penz, Bernard Gicquel, Celine Akbalik, Ayse Univ Lorraine LGIPM Technopole Metz F-57070 Metz France Univ Grenoble Alpes G SCOP Grenoble INP CNRS F-38000 Grenoble France Univ Paris Saclay LRI Univ Paris Sud F-91405 Orsay France
We study a single-item lot sizing problem integrated with some energy constraints, called energy-LSP in the rest of the paper. We consider a production system composed of identical and capacitated machines in parallel... 详细信息
来源: 评论
Finding Dominating Induced Matchings in P8-Free Graphs in polynomial time
收藏 引用
algorithmICA 2017年 第4期77卷 1283-1302页
作者: Brandstaedt, Andreas Mosca, Raffaele Univ Rostock Inst Informat A Einstein Str 22 D-18051 Rostock Germany Univ G DAnnunzio Dipartimento Econ I-65121 Pescara Italy
Let be a finite undirected graph. An edge set is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of . The Dominating Induced Matching (DIM) problem asks for the existe... 详细信息
来源: 评论
Energy-aware lot sizing problem: Complexity analysis and exact algorithms
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2018年 203卷 254-263页
作者: Rapine, Christophe Goisque, Guillaume Akbalik, Ayse Univ Lorraine LCOMS Technopole Metz Metz France Univ Lorraine Metz France
The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of e... 详细信息
来源: 评论
Computational Complexity and polynomial time Procedure of Response Property Problem in Workflow Nets
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2018年 第6期E101D卷 1503-1510页
作者: Bin Ab Malek, Muhammad Syafiq Bin Ahmadon, Mohd Anuaruddin Yamaguchi, Shingo Yamaguchi Univ Grad Sch Sci & Technol Innovat Ube Yamaguchi 7558611 Japan
Response property is a kind of liveness property. Response property problem is defined as follows: Given two activities alpha and beta whenever alpha is executed, is beta always executed after that? In this paper, we ... 详细信息
来源: 评论
polynomial time algorithmS FOR VARIANTS OF GRAPH MATCHING ON PARTIAL k-TREES
收藏 引用
FOUNDATIONS OF COMPUTING AND DECISION SCIENCES 2016年 第3期41卷 163-181页
作者: Nagoya, Takayuki Tottori Univ Environm Studies 1-1-1 Wakabadai Kita Tottori Tottori 6891111 Japan
In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is ... 详细信息
来源: 评论
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... 详细信息
来源: 评论