咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
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... 详细信息
来源: 评论
Equilibria for Joint Congestion Game With Destination and Route Choices
收藏 引用
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2024年 第12期25卷 21267-21277页
作者: Tan, Heqing Chen, Anthony Xu, Xiangdong Tongji Univ Key Lab Rd & Traff Engn Minist Educ Shanghai 201804 Peoples R China Hong Kong Polytech Univ Dept Civil & Environm Engn Hong Kong Peoples R China
We extend congestion games to the setting where players need to make multiple joint choices with interactions in a hierarchical manner (termed joint congestion game). At each choice dimension, players are involved in ... 详细信息
来源: 评论
Finding dominating induced matchings in P10-free graphs in polynomial time
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 990卷
作者: 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 G = (V, E) be a finite undirected graph. An edge set E ' c E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E '. The Dominating Induced Matching (DI... 详细信息
来源: 评论
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年 第3期47卷 45-45页
作者: Kononov, Alexander Pakulich, Marina Sobolev Inst Math Koptyuga 4 Novosibirsk 630090 Russia Novosibirsk State Univ Koptyuga 2 Novosibirsk 630090 Russia
We consider two versions of two-machine flow shop scheduling problems, where each job requires an additional resource from the start of its first operation till the end of its second operation. We refer to this resour... 详细信息
来源: 评论
The k-th Roman domination problem is polynomial on interval graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年 第3期48卷 1-14页
作者: Li, Peng Chongqing Univ Technol 69 Hongguang Rd Chongqing Peoples R China
Let G be some simple graph and k be any positive integer. Take h : V ( G )- {0,1, , ... ,k+1} and v is an element of V (G), let AN(h)(v) denote the set of vertices w is an element of N-G (v) with h (w) >= 1. Let AN... 详细信息
来源: 评论
Maximum weight independent sets for (S1,2,4, triangle)-free graphs in polynomial time
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 878卷 11-25页
作者: Brandstaedt, Andreas Mosca, Raffaele Univ Rostock Inst Informat D-18051 Rostock Germany Univ G DAnnunzio Dipartimento Econ I-65121 Pescara Italy
The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most im... 详细信息
来源: 评论
Vehicle scheduling problems with two agents on a line
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第1期45卷 1-18页
作者: Yan, Hao Liu, Peihai Lu, Xiwen East China Univ Sci & Technol Shanghai Peoples R China
This paper studies the two-agent vehicle scheduling problems on a line with the constraint that each job is processed after its release time. All jobs belong to agent A or agent B and each job is located at some verte... 详细信息
来源: 评论
Linear regression with partially mismatched data: local search with theoretical guarantees
收藏 引用
MATHEMATICAL PROGRAMMING 2023年 第2期197卷 1265-1303页
作者: Mazumder, Rahul Wang, Haoyue MIT Cambridge MA 02139 USA
Linear regression is a fundamental modeling tool in statistics and related fields. In this paper, we study an important variant of linear regression in which the predictor-response pairs are partially mismatched. We u... 详细信息
来源: 评论