咨询与建议

限定检索结果

文献类型

  • 311 篇 期刊文献
  • 68 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 235 篇 理学
    • 232 篇 数学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 2 篇 物理学
  • 232 篇 工学
    • 191 篇 计算机科学与技术...
    • 38 篇 软件工程
    • 33 篇 电气工程
    • 17 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 6 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 土木工程
    • 4 篇 交通运输工程
    • 2 篇 动力工程及工程热...
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 生物工程
  • 96 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 17 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 21 篇 经济学
    • 17 篇 应用经济学
    • 5 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 381 篇 polynomial-time ...
  • 36 篇 computational co...
  • 23 篇 np-completeness
  • 17 篇 np-hardness
  • 16 篇 np-hard
  • 16 篇 scheduling
  • 12 篇 np-complete
  • 11 篇 dynamic programm...
  • 10 篇 linear programmi...
  • 10 篇 graph theory
  • 9 篇 np-hard problem
  • 9 篇 independent set
  • 9 篇 combinatorial op...
  • 8 篇 approximation al...
  • 8 篇 stable matching
  • 7 篇 discrete tomogra...
  • 7 篇 matching
  • 7 篇 complexity
  • 6 篇 network
  • 5 篇 temporal graph

机构

  • 16 篇 univ warwick mat...
  • 15 篇 univ warwick dim...
  • 7 篇 rutgers state un...
  • 7 篇 univ durham dept...
  • 6 篇 univ glasgow dep...
  • 6 篇 hong kong polyte...
  • 6 篇 univ rostock ins...
  • 5 篇 natl res univ hi...
  • 4 篇 zhengzhou univ s...
  • 4 篇 univ g dannunzio...
  • 4 篇 kwansei gakuin u...
  • 4 篇 natl res univ hi...
  • 3 篇 univ ioannina de...
  • 3 篇 univ glasgow sch...
  • 3 篇 univ primorska u...
  • 3 篇 kyoto univ grad ...
  • 3 篇 russian acad sci...
  • 3 篇 ben gurion univ ...
  • 3 篇 univ wisconsin d...
  • 3 篇 univ wisconsin w...

作者

  • 15 篇 milanic martin
  • 13 篇 lozin vadim
  • 11 篇 lozin vadim v.
  • 10 篇 manlove david f.
  • 10 篇 malyshev d. s.
  • 10 篇 miwa hiroyoshi
  • 9 篇 mosca raffaele
  • 7 篇 paulusma daniel
  • 7 篇 brandstaedt andr...
  • 7 篇 kobayashi yusuke
  • 6 篇 mertzios george ...
  • 6 篇 ries bernard
  • 5 篇 purcell christop...
  • 5 篇 van iersel leo
  • 4 篇 lin lan
  • 4 篇 gritzmann p
  • 4 篇 maeda nao
  • 4 篇 golovach petr a.
  • 4 篇 del pia alberto
  • 4 篇 papadopoulos cha...

语言

  • 328 篇 英文
  • 51 篇 其他
  • 1 篇 土耳其文
  • 1 篇 中文
检索条件"主题词=Polynomial-time algorithm"
381 条 记 录,以下是241-250 订阅
排序:
Separable standard quadratic optimization problems
收藏 引用
OPTIMIZATION LETTERS 2012年 第5期6卷 857-866页
作者: Bomze, Immanuel M. Locatelli, Marco Univ Vienna Vienna Austria Univ Parma I-43100 Parma Italy
A standard quadratic optimization problems (StQP) asks for the minimal value of a quadratic form over the standard simplex. StQPs form a central NP-hard class in quadratic optimization and have numerous practical appl... 详细信息
来源: 评论
"Almost stable" matchings in the Roommates problem with bounded preference lists
收藏 引用
THEORETICAL COMPUTER SCIENCE 2012年 432卷 10-20页
作者: Biro, Peter Manlove, David F. McDermid, Eric J. Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland Hungarian Acad Sci Inst Econ Budapest Hungary 21st Century Technol Inc Austin TX 78730 USA
An instance of the classical Stable Roommates problem need not admit a stable matching. Previous work has considered the problem of finding a matching that is "as stable as possible", i.e., admits the minimu... 详细信息
来源: 评论
Restricted vertex multicut on permutation graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2012年 第12期160卷 1791-1797页
作者: Papadopoulos, Charis Univ Ioannina Dept Math GR-45110 Ioannina Greece
Given an undirected graph and pairs of terminals the RESTRICTED VERTEX MULTICUT problem asks for a minimum set of nonterminal vertices whose removal disconnects each pair of terminals. The problem is known to be NP-co... 详细信息
来源: 评论
The x-and-y-axes travelling salesman problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年 第2期223卷 333-345页
作者: Cela, Eranda Deineko, Vladimir Woeginger, Gerhard J. Warwick Business Sch Coventry CV4 7AL W Midlands England TU Eindhoven Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands Graz Univ Technol Inst Optimierung & Diskrete Math A-8010 Graz Austria
The x-and-y-axes travelling salesman problem forms a special case of the Euclidean TSP, where all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system of the Euclidean plane. By caref... 详细信息
来源: 评论
Zero Duality Gap in Optimal Power Flow Problem
收藏 引用
IEEE TRANSACTIONS ON POWER SYSTEMS 2012年 第1期27卷 92-107页
作者: Lavaei, Javad Low, Steven H. CALTECH Dept Control & Dynam Syst Pasadena CA 91125 USA CALTECH Dept Comp Sci & Elect Engn Pasadena CA 91125 USA
The optimal power flow (OPF) problem is nonconvex and generally hard to solve. In this paper, we propose a semidefinite programming (SDP) optimization, which is the dual of an equivalent form of the OPF problem. A glo... 详细信息
来源: 评论
An algorithm for finding a maximum t-matching excluding complete partite subgraphs
收藏 引用
DISCRETE OPTIMIZATION 2012年 第2期9卷 98-108页
作者: Kobayashi, Yusuke Yin, Xin Univ Tokyo Grad Sch Informat Sci & Technol Tokyo 1138656 Japan Stanford Univ Inst Computat & Math Engn Stanford CA 94305 USA
For an integer t and a Fixed graph H, we consider the problem of Finding a maximum t-matching not containing H as a subgraph, which we call the H-free t-matching problem. This problem is a generalization of the proble... 详细信息
来源: 评论
On the complexity of the Eulerian closed walk with precedence path constraints problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2012年 439卷 16-29页
作者: Kerivin, H. L. M. Lacroix, M. Mahjoub, A. R. Univ Blaise Pascal Clermont Ferrand II CNRS UMR 6158 LIMOS F-63177 Aubiere France Clemson Univ Dept Math Sci Clemson SC 29634 USA
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some precedence constraints specified by paths... 详细信息
来源: 评论
A random fuzzy minimum spanning tree problem through a possibility-based value at risk model
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2012年 第12期39卷 10639-10646页
作者: Katagiri, Hideki Kato, Kosuke Hasuike, Takashi Hiroshima Univ Fac Engn Hiroshima 7398527 Japan Hiroshima Inst Technol Fac Appl Informat Sci Saeki Ku Hiroshima 7315193 Japan Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 5650871 Japan
This paper considers a minimum spanning tree problem under the situation where costs for constructing edges in a network include both fuzziness and randomness. In particular, this article focuses on the case that the ... 详细信息
来源: 评论
THE MAXIMUM-WEIGHT STABLE MATCHING PROBLEM: DUALITY AND EFFICIENCY
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2012年 第3期26卷 1346-1360页
作者: Chen, Xujin Ding, Guoli Hu, Xiaodong Zang, Wenan Chinese Acad Sci Inst Appl Math Beijing 100190 Peoples R China Louisiana State Univ Dept Math Baton Rouge LA 70803 USA Univ Hong Kong Dept Math Hong Kong Hong Kong Peoples R China
Given a preference system (G, <) and an integral weight function defined on the edge set of G (not necessarily bipartite), the maximum-weight stable matching problem is to find a stable matching of (G, <) with m... 详细信息
来源: 评论
COMPUTING ISOMETRY GROUPS OF HERMITIAN MAPS
收藏 引用
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY 2012年 第4期364卷 1975-1996页
作者: Brooksbank, Peter A. Wilson, James B. Bucknell Univ Dept Math Lewisburg PA 17837 USA Ohio State Univ Dept Math Columbus OH 43210 USA
A theorem is proved on the structure of the group of isometries of a Hermitian map b: V X V -> W, where V and W are vector spaces over a finite field of odd order. Also a Las Vegas polynomial-time algorithm is pres... 详细信息
来源: 评论