咨询与建议

限定检索结果

文献类型

  • 385 篇 期刊文献
  • 27 篇 会议
  • 4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 299 篇 理学
    • 294 篇 数学
    • 12 篇 统计学(可授理学、...
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 1 篇 物理学
  • 184 篇 工学
    • 124 篇 计算机科学与技术...
    • 44 篇 软件工程
    • 27 篇 控制科学与工程
    • 18 篇 电气工程
    • 14 篇 机械工程
    • 8 篇 信息与通信工程
    • 5 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 电子科学与技术(可...
    • 3 篇 石油与天然气工程
    • 2 篇 化学工程与技术
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 151 篇 管理学
    • 148 篇 管理科学与工程(可...
    • 16 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 16 篇 经济学
    • 13 篇 应用经济学
    • 3 篇 理论经济学
  • 7 篇 教育学
    • 7 篇 心理学(可授教育学...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 416 篇 polynomial algor...
  • 37 篇 complexity
  • 27 篇 scheduling
  • 17 篇 np-completeness
  • 15 篇 linear programmi...
  • 13 篇 dynamic programm...
  • 12 篇 np-complete
  • 11 篇 computational co...
  • 11 篇 combinatorial op...
  • 10 篇 stable set
  • 10 篇 kernel function
  • 9 篇 np-hardness
  • 8 篇 graph
  • 8 篇 matching
  • 7 篇 graphs
  • 7 篇 tree
  • 6 篇 longest path pro...
  • 6 篇 interior-point m...
  • 6 篇 independent set
  • 6 篇 hamiltonian cycl...

机构

  • 9 篇 univ southern de...
  • 8 篇 rutgers state un...
  • 8 篇 pusan natl univ ...
  • 6 篇 dongseo univ dep...
  • 5 篇 univ so denmark ...
  • 5 篇 univ southern de...
  • 5 篇 univ toronto div...
  • 5 篇 univ nizhny novg...
  • 4 篇 univ paris 09 la...
  • 4 篇 inst engn cybern...
  • 4 篇 kyoto univ grad ...
  • 4 篇 univ johannesbur...
  • 4 篇 belarusian state...
  • 4 篇 univ ioannina de...
  • 3 篇 beijing inst tec...
  • 3 篇 odense univ dept...
  • 3 篇 moscow mv lomono...
  • 3 篇 lomonosov moscow...
  • 3 篇 univ primorska u...
  • 3 篇 eotvos lorand un...

作者

  • 13 篇 lozin vv
  • 11 篇 bang-jensen jorg...
  • 9 篇 nagamochi h
  • 8 篇 mertzios george ...
  • 8 篇 cho gyeong-mi
  • 7 篇 ibaraki t
  • 7 篇 hansen p
  • 6 篇 averbakh igor
  • 6 篇 jaumard b
  • 6 篇 bang-jensen j.
  • 6 篇 bang-jensen j
  • 6 篇 gerber mu
  • 5 篇 hertz a
  • 5 篇 averbakh i
  • 5 篇 levner eugene
  • 5 篇 yeo anders
  • 5 篇 woeginger gj
  • 4 篇 tao yuegang
  • 4 篇 tuza z
  • 4 篇 chu chengbin

语言

  • 336 篇 英文
  • 77 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=Polynomial algorithm"
416 条 记 录,以下是31-40 订阅
排序:
A polynomial projection algorithm for linear feasibility problems
收藏 引用
MATHEMATICAL PROGRAMMING 2015年 第2期153卷 687-713页
作者: Chubanov, Sergei Univ Siegen Inst Informat Syst D-57068 Siegen Germany
We propose a polynomial algorithm for linear feasibility problems. The algorithm represents a linear problem in the form of a system of linear equations and non-negativity constraints. Then it uses a procedure which e... 详细信息
来源: 评论
A polynomial algorithm for the Two-Variable Integer Programming Problem
收藏 引用
Journal of the ACM (JACM) 1980年 第1期27卷 118-122页
作者: Kannan, Ravindran Department of Electrical Engineering and Computer Science Division of Computer Science University of California Berkeley CA 94720 United States Cornell University Ithaca New York United States
A polynomial time algorithm is presented for solving the following two-variable ineger programming problem maximize [formula-omitted] integers, where a,j, cj, and b, are assumed to be nonnegattve integers This generah... 详细信息
来源: 评论
polynomial Filtering algorithm for Single-Beacon Navigation Problem
Polynomial Filtering Algorithm for Single-Beacon Navigation ...
收藏 引用
17th IFAC Technical-Committee-on-Optimal-Control (TC 2.4) Workshop on Control Applications of Optimization (CAO)
作者: Stepanov, Oleg A. Toropov, Anton B. Loparev, Alexei V. Vasiliev, Vladimir A. Basin, Michael V. ITMO Univ JSC Concern CSRI Elektropribor St Petersburg Russia JSC Concern CSRI Elektropribor St Petersburg Russia Autonomous Univ Nuevo Leon San Nicolas De Los Garza Mexico ITMO Univ St Petersburg Russia
A polynomial filtering algorithm is proposed to solve a sea vehicle navigation problem using information on the range and radial velocity with respect to a fixed beacon, formulated in the context of the Bayesian appro... 详细信息
来源: 评论
polynomial algorithms for a class of minimum rank-two cost path problems
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 1999年 第4期15卷 405-417页
作者: Kuno, T Univ Tsukuba Inst Informat Sci & Elect Tsukuba Ibaraki 305 Japan
In this paper, we develop two algorithms for finding a directed path of minimum rank-two monotonic cost between two specified nodes in a network with n nodes and m arcs. Under the condition that one of the vectors cha... 详细信息
来源: 评论
Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1042卷
作者: Saez, Pablo
We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not. Research until now has been focused mainly on the optimization... 详细信息
来源: 评论
polynomial algorithms for nested univariate clustering
收藏 引用
DISCRETE MATHEMATICS 2002年 第1-3期245卷 93-105页
作者: Hansen, P Jaumard, B Simeone, B Ecole Polytech GERAD Montreal PQ H3T 1V6 Canada Ecole Polytech Ecole Hautes Etud Commerciales Montreal PQ H3T 1V6 Canada Univ La Sapienza Dept Stat Rome Italy
Clique partitioning in Euclidean space R-n consists in finding a partition of a given set of N points into M clusters in order to minimize the sum of within-cluster interpoint distances. For n = 1 clusters need not co... 详细信息
来源: 评论
On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables
收藏 引用
OPERATIONS RESEARCH LETTERS 2025年 58卷
作者: de Araujo, Daniel de Araujo, Daniel Uchoa, Eduardo Univ Fed Fluminense Rua Passo Patria 156 BR-24210240 Niteroi RJ Brazil
Mixed integer programming formulations for the Split Delivery Vehicle Routing Problem (SDVRP) typically use edge decision variables. It was believed that feasibility couldn't be verified in polynomial time. We sho... 详细信息
来源: 评论
polynomial algorithmS FOR COMPUTING THE SMITH AND HERMITE NORMAL FORMS OF AN INTEGER MATRIX
收藏 引用
SIAM JOURNAL ON COMPUTING 1979年 第4期8卷 499-507页
作者: KANNAN, R BACHEM, A
Recently, Frumkin [9] pointed out that none of the well-known algorithms that transform an integer matrix into Smith [16] or Hermite [12] normal form is known to be polynomially bounded in its running time. In fact, B... 详细信息