咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 282 篇 polynomial time ...
  • 21 篇 np-complete
  • 19 篇 computational co...
  • 17 篇 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 篇 traveling salesm...
  • 6 篇 graph algorithms
  • 6 篇 dynamic programm...
  • 6 篇 dominating induc...
  • 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

语言

  • 250 篇 英文
  • 31 篇 其他
检索条件"主题词=Polynomial Time Algorithm"
282 条 记 录,以下是21-30 订阅
polynomial time algorithms to Minimize Total Travel time in a Two-Depot Automated Storage/Retrieval System
收藏 引用
TRANSPORTATION SCIENCE 2017年 第1期51卷 19-33页
作者: Gharehgozli, Amir Hossein Yu, Yugang Zhang, Xiandong de Koster, Rene Erasmus Univ Rotterdam Sch Management NL-3062 PA Rotterdam Netherlands Univ Sci & Technol China Sch Management Hefei 230026 Peoples R China Fudan Univ Sch Management Dept Management Sci Shanghai 200433 Peoples R China Texas A&M Univ Dept Maritime Adm Galveston TX 77554 USA
We sequence storage and retrieval jobs to minimize total travel time of a storage/retrieval (S/R) machine in a two-depot automated storage/retrieval system. These systems include storage systems with aisle-captive S/R... 详细信息
来源: 评论
polynomial time algorithms for two classes of subgraph problem
收藏 引用
RAIRO-OPERATIONS RESEARCH 2008年 第3期42卷 291-298页
作者: Sridharan, Sriraman Univ Perpignan Dept Math & Informat F-66100 Perpignan France
We design a O(n(3)) polynomial time algorithm for finding a (k - 1)- regular subgraph in a k-regular graph without any induced star K(1,3)(claw-free). A polynomial time algorithm for finding a cubic subgraph in a 4-re... 详细信息
来源: 评论
polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
收藏 引用
OPERATIONS RESEARCH LETTERS 2012年 第5期40卷 390-397页
作者: Akbalik, Ayse Rapine, Christophe Univ Lorraine LGIPM F-57012 Metz France
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production c... 详细信息
来源: 评论
A polynomial time Pattern Matching algorithm on Graph Patterns of Bounded Treewidth
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2017年 第9期E100A卷 1764-1772页
作者: Shoudai, Takayoshi Yamada, Takashi Kyushu Int Univ Fac Contemporary Business Kitakyushu Fukuoka 8058512 Japan Kyushu Univ Dept Informat Fukuoka 8190395 Japan Okinawa Prefectural Govt Naha Japan
This paper deals with a problem to decide whether a given graph structure appears as a pattern in the structure of a given graph. A graph pattern is a triple p = (V, E, H), where (V, E) is a graph and H is a set of va... 详细信息
来源: 评论
polynomial time algorithms for Determining Optimal Strategies
收藏 引用
Electronic Notes in Discrete Mathematics 2003年 13卷 64-68页
作者: Lozovanu, Dmitrii Pickl, Stefan Institute of Mathematics and Computer Science Academy of Sciences Academy str. MD-2028 Moldova 5 Kishinev Germany Institute of Mathematics Center of Applied Computer Science University of Cologne Germany
We study the multiobjective control of time-discrete systems with given starting and final states. The dynamics of the system is controled by p actors (players) which intend to minimize their integral-time costs of sy... 详细信息
来源: 评论
Injective coloring of subclasses of chordal graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1023卷
作者: Panda, B. S. Ghosh, Rumki Indian Inst Technol Delhi Dept Math New Delhi 110016 India
An injective k-coloring of a graph G=(V,E) is a function f:V ->{1,2,& mldr;,k} such that for every pair of vertices u and v having a common neighbor, f(u)not equal f(v). The injective chromatic number chi(i)(G)... 详细信息
来源: 评论
Lot sizing with capacity adjustment using on-site green and grid electricity
收藏 引用
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2025年 133卷
作者: Akbalik, Ayse Gicquel, Celine Penz, Bernard Rapine, Christophe Univ Lorraine Lab LCOMS 3 Rue Augustin Fresnel F-57073 Metz France Univ Paris Saclay Lab Interdisciplinaire Sci Numer LISN F-91190 Gif Sur Yvette France Univ Grenoble Alpes CNRS Grenoble INP G SCOP F-38000 Grenoble France
This paper investigates from a theoretical point of view how on-site generation of renewable energy can be incorporated in the optimization of a mid-term production and capacity planning problem. Specifically, we cons... 详细信息
来源: 评论
On the thinness of trees
收藏 引用
DISCRETE APPLIED MATHEMATICS 2025年 365卷 39-60页
作者: Bonomo-Braberman, Flavia Brandwein, Eric Gonzalez, Carolina Lucia Sansone, Agustin Univ BUENOS AIRES Fac CIENCIAS EXACTAS & Nat Dept Comp Buenos Aires Argentina Univ Buenos Aires CONICET Inst Invest Ciencias Comp ICC Buenos Aires Argentina
The study of structural graph width parameters like tree-width, clique-width and rankwidth has been ongoing during the last five decades, and their algorithmic use has also been increasing (Cygan et al., 2015). New wi... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
SIMULATED ANNEALING BASED polynomial time QOS ROUTING algorithm FOR MANETS
收藏 引用
Journal of Electronics(China) 2006年 第5期23卷 691-697页
作者: Liu Lianggui Feng Guangzeng College of Communications and Information Engineering Nanjing University of Posts & Telecommunications Nanjing 210003 China
Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing algorithm based on Simulated Anneal... 详细信息
来源: 评论