咨询与建议

限定检索结果

文献类型

  • 115 篇 期刊文献
  • 16 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 91 篇 工学
    • 70 篇 计算机科学与技术...
    • 22 篇 电气工程
    • 18 篇 软件工程
    • 8 篇 信息与通信工程
    • 5 篇 电子科学与技术(可...
    • 2 篇 机械工程
    • 2 篇 控制科学与工程
    • 2 篇 生物工程
  • 82 篇 理学
    • 74 篇 数学
    • 7 篇 生物学
    • 5 篇 统计学(可授理学、...
    • 1 篇 物理学
  • 36 篇 管理学
    • 36 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 4 篇 经济学
    • 3 篇 应用经济学
    • 1 篇 理论经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 医学

主题

  • 132 篇 polynomial-time ...
  • 14 篇 computational co...
  • 13 篇 np-completeness
  • 10 篇 linear programmi...
  • 7 篇 scheduling
  • 4 篇 graph algorithms
  • 4 篇 ellipsoid method
  • 4 篇 strong perfect g...
  • 4 篇 preemptive sched...
  • 4 篇 dynamic programm...
  • 3 篇 routing
  • 3 篇 np-hard
  • 3 篇 interior-point m...
  • 3 篇 spectrum-efficie...
  • 3 篇 simple paths
  • 3 篇 coloring
  • 3 篇 labeled directed...
  • 3 篇 combinatorial re...
  • 3 篇 algebraic number...
  • 3 篇 regular expressi...

机构

  • 4 篇 univ sharjah dep...
  • 4 篇 new jersey inst ...
  • 4 篇 nankai univ coll...
  • 3 篇 univ bergen dept...
  • 2 篇 ist austria klos...
  • 2 篇 univ vienna fac ...
  • 2 篇 univ pompeu fabr...
  • 2 篇 1.department of ...
  • 2 篇 univ warsaw inst...
  • 2 篇 zhengzhou univ s...
  • 2 篇 univ montpellier...
  • 2 篇 department of ci...
  • 2 篇 ntt corp 3-9-11 ...
  • 2 篇 univ ghent dept ...
  • 2 篇 columbia univ de...
  • 2 篇 sobolev inst mat...
  • 2 篇 univ cape town d...
  • 2 篇 kyoto univ grad ...
  • 2 篇 univ montpellier...
  • 2 篇 kyoto univ acad ...

作者

  • 4 篇 watanabe t
  • 4 篇 adler i
  • 4 篇 huang shenwei
  • 4 篇 jones mark
  • 4 篇 saad mohamed
  • 4 篇 scornavacca celi...
  • 3 篇 heggernes pinar
  • 3 篇 suzuki akira
  • 3 篇 beling pa
  • 3 篇 miyazaki shuichi
  • 3 篇 paul christophe
  • 3 篇 padberg m
  • 2 篇 monteiro rdc
  • 2 篇 yuan jinjiang
  • 2 篇 okamoto kazuya
  • 2 篇 hamada koki
  • 2 篇 varvarigou ta
  • 2 篇 xia wen
  • 2 篇 leung joseph y. ...
  • 2 篇 meister daniel

语言

  • 118 篇 英文
  • 13 篇 其他
  • 1 篇 俄文
检索条件"主题词=Polynomial-time algorithms"
132 条 记 录,以下是31-40 订阅
排序:
Multiechelon Lot Sizing: New Complexities and Inequalities
收藏 引用
OPERATIONS RESEARCH 2020年 第2期68卷 534-551页
作者: Zhao, Ming Zhang, Minjiao Univ Delaware Lerner Coll Business & Econ Newark DE 19716 USA Kennesaw State Univ Michael J Coles Coll Business Dept Econ Finance & Quantitat Anal Kennesaw GA 30144 USA
We study a multiechelon lot-sizing problem for a serial supply chain that consists of a production level and several transportation levels, where the demands can exist in the production echelon as well as in any trans... 详细信息
来源: 评论
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
收藏 引用
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2020年 第2期18卷 177-196页
作者: Chen, Rubing Yuan, Jinjiang Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Henan Peoples R China
In this paper, we study the scheduling of proportional-linearly deteriorating jobs with positional due indices, release dates, deadlines and precedence relations on a single machine. The scheduling criteria studied in... 详细信息
来源: 评论
Reconfiguring k-path Vertex Covers  14th
Reconfiguring k-path Vertex Covers
收藏 引用
14th International Conference and Workshops on algorithms and Computation (WALCOM)
作者: Hoang, Duc A. Suzuki, Akira Yagita, Tsuyoshi Kyushu Inst Technol Fukuoka Japan Tohoku Univ Sendai Miyagi Japan
A vertex subset I of a graph G is called a k-path vertex cover if every path on k vertices in G contains at least one vertex from I. The k-Path Vertex Cover Reconfiguration (k-PVCR) problem asks if one can transform o... 详细信息
来源: 评论
Bribery and Control in Stable Marriage  13th
Bribery and Control in Stable Marriage
收藏 引用
13th International Symposium on Algorithmic Game Theory (SAGT)
作者: Boehmer, Niclas Bredereck, Robert Heeger, Klaus Niedermeier, Rolf TU Berlin Algorithm & Computat Complex Berlin Germany
We initiate the study of external manipulations in STABLE MARRIAGE by considering several manipulative actions as well as several "desirable" manipulation goals. For instance, one goal is to make sure that a... 详细信息
来源: 评论
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings  31st
Strongly Stable and Maximum Weakly Stable Noncrossing Matchi...
收藏 引用
31st International Workshop on Combinatorial algorithms (IWOCA)
作者: Hamada, Koki Miyazaki, Shuichi Okamoto, Kazuya NTT Corp 3-9-11 Midori Cho Musashino Tokyo 1808585 Japan Kyoto Univ Grad Sch Informat Sakyo Ku Yoshida Honmachi Kyoto 6068501 Japan Kyoto Univ Acad Ctr Comp & Media Studies Sakyo Ku Yoshida Honmachi Kyoto 6068501 Japan Kyoto Univ Hosp Div Med Informat Technol & Adm Planning Sakyo Ku 54 Kawaharacho Kyoto 6068507 Japan
In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings, where participants of each side are aligned on each of two parallel lines, and no two matching edges are allowed to cross each other. They de... 详细信息
来源: 评论
Two-echelon lot-sizing with asymmetric information and continuous type space
收藏 引用
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2019年 87卷 158-176页
作者: Kerkkamp, R. B. O. van den Heuvel, W. Wagelmans, A. P. M. Erasmus Univ Econometr Inst Postbus 1738 NL-3000 DR Rotterdam Netherlands
We analyse a two-echelon discrete lot-sizing problem with a supplier and a retailer under information asymmetry. We assume that all cost parameters are time independent and that the retailer has single dimensional con... 详细信息
来源: 评论
Critical (P6, banner)-free graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2019年 258卷 143-151页
作者: Huang, Shenwei Li, Tao Shi, Yongtang Nankai Univ Coll Comp Sci Tianjin 300071 Peoples R China Nankai Univ Ctr Combinator Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China
Given two graphs H-1 and H-2, a graph is (H-1, H-2)-free if it contains no induced subgraph isomorphic to H-1 or H-2. Let P-t and C-t be the path and the cycle on t vertices, respectively. A banner is the graph obtain... 详细信息
来源: 评论
The graph of atomic divisors and recognition of finite simple groups
收藏 引用
JOURNAL OF ALGEBRA 2019年 537卷 478-502页
作者: Buturlakin, Alexander A. Vasil'ev, Audrey V. Sobolev Inst Math 4 Acad Koptyug Ave Novosibirsk 630090 Russia Novosibirsk State Univ 2 Pirogova Str Novosibirsk 630090 Russia
The spectrum omega(G) of a finite group G is the set of orders of elements of G. We present a polynomial-time algorithm that, given a finite set M of positive integers, outputs either an empty set or a finite simple g... 详细信息
来源: 评论
Paths and trails in edge-colored weighted graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 799卷 104-114页
作者: Miao, Runjie Yuan, Jinjiang Huang, Fei Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Henan Peoples R China
Let (G, c, w) be an edge-colored weighted graph, where G is a nontrivial connected graph, c is an edge-coloring of G, and w is an edge-weighting of G. A path, a trail, a cycle, or a closed trail of G, say F, is called... 详细信息
来源: 评论
Stable roommates with narcissistic, single-peaked, and single-crossing preferences
收藏 引用
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2020年 第2期34卷 53-53页
作者: Bredereck, Robert Chen, Jiehua Finnendahl, Ugo Paavo Niedermeier, Rolf TU Berlin Berlin Germany TU Wien Vienna Austria
The classicalStable Roommatesproblem is to decide whether there exists a matching of an even number of agents such that no two agents which are not matched to each other would prefer to be with each other rather than ... 详细信息
来源: 评论