咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是111-120 订阅
Improved algorithms for joint optimization of facility locations and network connections
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年 第3期250卷 745-753页
作者: Lai, Xiaofan Xu, Zhou Hong Kong Polytech Univ Fac Business Dept Logist & Maritime Studies Kowloon Hong Kong Peoples R China
This paper studies a k-median Steiner forest problem that jointly optimizes the opening of at most k facility locations and their connections to the client locations, so that each client is connected by a path to an o... 详细信息
来源: 评论
L1 Norm Minimal Mode-Based Methods for Listing Reaction Network Designs for Metabolite Production
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2021年 第5期E104D卷 679-687页
作者: Tamura, Takeyuki Kyoto Univ Bioinformat Ctr Inst Chem Res Uji Kyoto 6110011 Japan
Metabolic networks represent the relationship between chemical reactions and compounds in cells. In useful metabolite production using microorganisms, it is often required to calculate reaction deletion strategies fro... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Optimal Screening of Populations with Heterogeneous Risk Profiles Under the Availability of Multiple Tests
收藏 引用
INFORMS JOURNAL ON COMPUTING 2022年 第1期34卷 150-164页
作者: Aprahamian, Hrayer El-Amine, Hadi Texas A&M Univ Dept Ind & Syst Engn College Stn TX 77843 USA George Mason Univ Dept Syst Engn & Operat Res Fairfax VA 22030 USA
We study the design of large-scale group testing schemes under a heterogeneous population (i.e., subjects with potentially different risk) and with the availability of multiple tests. The objective is to classify the ... 详细信息
来源: 评论
Stable sets of maximum weight in (P7, banner)-free graphs
收藏 引用
DISCRETE MATHEMATICS 2008年 第1期308卷 20-33页
作者: Mosca, Raffaele Univ G DAnnunzio Dipartimento Sci Pescara 65127 Italy
We prove that on (P-7, banner)-free graphs the maximum weight stable set problem is solvable in polynomial time. (c) 2007 Elsevier B.V. All rights reserved.
来源: 评论
Some observations on maximum weight stable sets in certain P5-free graphs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年 第3期184卷 849-859页
作者: Mosca, Raffaele Univ Studi G d Annunzio Dipartimento Sci I-65127 Pescara Italy
The maximum weight stable set problem (MWS) is the weighted version of the maximum stable set problem (MS), which is NP-hard. The class of P-5-free graphs - i.e., graphs with no induced path of five vertices - is the ... 详细信息
来源: 评论
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第2期257卷 483-493页
作者: Akbalik, Ayse Hadj-Alouane, Atidel B. Sauer, Nathalie Ghribi, Houcem Univ Lorraine Lab LGIPM F-57012 Metz France Univ Tunis El Manar Ecole Natl Ingn Tunis OASIS BP 37 Le Belvedere Tunis 1002 Tunisia
In this paper, we study the single-item lot sizing problem under a capacity reservation contract. A manufacturer is replenished by an external supplier with batch deliveries and a certain capacity is reserved at the s... 详细信息
来源: 评论
Injective coloring of some subclasses of bipartite graphs and chordal graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2021年 291卷 68-87页
作者: Panda, B. S. Priyamvada Indian Inst Technol Delhi Dept Math New Delhi 110016 India
A vertex coloring of a graph G = (V, E) that uses k colors is called an injective k-coloring of G if no two vertices having a common neighbor have the same color. The minimum k for which G has an injective k-coloring ... 详细信息
来源: 评论
Double vertex-edge domination in graphs: complexity and algorithms
收藏 引用
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2021年 第1-2期66卷 245-262页
作者: Naresh Kumar, H. Pradhan, D. Venkatakrishnan, Y. B. SASTRA Deemed Univ Dept Math Thanjavur India Indian Inst Technol ISM Dept Math & Comp Dhanbad Bihar India
In a graph G = (V, E), a vertex v is an element of V is said to ve-dominate the edges incident on v as well as the edges adjacent to these incident edges on v. A set D subset of V is called a double vertex-edge domina... 详细信息
来源: 评论