咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是121-130 订阅
Spanning subgraphs of graphs partitioned into two isomorphic pieces
收藏 引用
JOURNAL OF GRAPH THEORY 2006年 第2期51卷 123-136页
作者: Bonato, A Wilfrid Laurier Univ Dept Math Waterloo ON N2L 3C5 Canada
A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced by the closed non-neighbor set of x. As ... 详细信息
来源: 评论
THE GENERALIZED TERMINAL BACKUP PROBLEM
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2015年 第3期29卷 1764-1782页
作者: Bernath, Attila Kobayashi, Yusuke Matsuoka, Tatsuya Eotvos Lorand Univ Dept Operat Res MTA ELTE Egervary Res Grp Budapest Hungary Univ Tsukuba Tsukuba Ibaraki 3058573 Japan Univ Tokyo Tokyo 1138656 Japan
We consider the following network design problem that we call the Generalized Terminal Backup Problem: given a graph (or a hypergraph) G(0) = (V, E-0), a set of (at least 2) terminals T subset of V, and a requirement ... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
Structural Grobner basis detection
收藏 引用
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 1997年 第4期8卷 257-263页
作者: Sturmfels, B Wiegelmann, M UNIV CALIF BERKELEY DEPT MATHBERKELEYCA 94720 UNIV TRIER FACHBEREICH MATHD-54286 TRIERGERMANY
We determine the computational complexity of deciding whether m polynomials in n variables have relatively prime leading terms with respect to some term order. This problem in NP-complete in general, but solvable in p... 详细信息
来源: 评论
Cycle Extensions in BIBD Block-Intersection Graphs
收藏 引用
JOURNAL OF COMBINATORIAL DESIGNS 2013年 第7期21卷 303-310页
作者: Abueida, Atif A. Pike, David A. Univ Dayton Dept Math Dayton OH 45469 USA Mem Univ Newfoundland Dept Math & Stat St John NF A1C 5S7 Canada
A cycle C in a graph G is extendable if there is some other cycle in G that contains each vertex of C plus one additional vertex. A graph is cycle extendable if every non-Hamilton cycle in the graph is extendable. A b... 详细信息
来源: 评论
OPTIMIZING THE SYSTEM OF VIRTUAL PATHS
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 1994年 第6期2卷 581-587页
作者: CHLAMTAC, I FARAGO, A ZHANG, T Dept. of Electr. & Comput. Eng. Massachusetts Univ. Amherst MA USA
The virtual path (VP) concept is known to be a powerful transport mechanism for ATM networks. This paper deals with the optimization of the virtual paths system from a bandwidth utilization perspective. While previous... 详细信息
来源: 评论
Envy-Free Matchings with Lower Quotas
收藏 引用
algorithmICA 2020年 第2期82卷 188-211页
作者: Yokoi, Yu Natl Inst Informat Tokyo 1018430 Japan
While every instance of the Hospitals/Residents problem admits a stable matching, the problem with lower quotas (HR-LQ) has instances with no stable matching. For such an instance, we expect the existence of an envy-f... 详细信息
来源: 评论
TWO-AGENT VEHICLE SCHEDULING PROBLEM ON A LINE-SHAPED NETWORK
收藏 引用
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2023年 第7期19卷 4874-4892页
作者: Yan, Hao Liu, Peihai Lu, Xiwen East China Univ Sci & Technol Dept Math Shanghai 200237 Peoples R China
This paper studies single vehicle scheduling problems with two agents on a line-shaped network. Each of two agents has some customers that are situated at some vertices on the network. A vehicle has to start from upsi... 详细信息
来源: 评论
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
收藏 引用
MATHEMATICAL PROGRAMMING 1998年 第1-2期82卷 235-254页
作者: van der Veen, JAA Woeginger, GJ Zhang, SZ Nijenrode Univ Netherlands Business Sch Ctr Supply Chain Management NL-3621 BG Breukelen Netherlands Graz Tech Univ Inst Math B A-8010 Graz Austria Erasmus Univ Inst Econometr NL-3000 DR Rotterdam Netherlands
In this paper a one-machine scheduling model is analyzed where n different jobs are classified into K groups depending on which additional resource they require. The change-over time from one job to another consists o... 详细信息
来源: 评论
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
收藏 引用
MATHEMATICAL PROGRAMMING 1996年 第3期72卷 291-305页
作者: Muramatsu, M Tsuchiya, T INST STAT MATH MINATO KUTOKYO 106JAPAN
In this paper we give a new convergence analysis of a projective scaling algorithm. We consider a long-step affine scaling algorithm applied to a homogeneous linear programming problem obtained from the original linea... 详细信息
来源: 评论