咨询与建议

限定检索结果

文献类型

  • 26 篇 期刊文献
  • 6 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 22 篇 工学
    • 18 篇 计算机科学与技术...
    • 8 篇 软件工程
    • 1 篇 控制科学与工程
    • 1 篇 石油与天然气工程
  • 21 篇 理学
    • 21 篇 数学
    • 1 篇 统计学(可授理学、...
  • 15 篇 管理学
    • 15 篇 管理科学与工程(可...
    • 3 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 3 篇 经济学
    • 2 篇 应用经济学
    • 1 篇 理论经济学

主题

  • 32 篇 strongly polynom...
  • 5 篇 linear programmi...
  • 4 篇 hamming distance
  • 3 篇 inverse problems
  • 3 篇 network flow alg...
  • 3 篇 min-max spanning...
  • 3 篇 convex optimizat...
  • 2 篇 submodular funct...
  • 2 篇 neural network e...
  • 2 篇 algorithms
  • 2 篇 convex network f...
  • 2 篇 minimum spanning...
  • 2 篇 nonlinear optimi...
  • 2 篇 minimum cost cir...
  • 2 篇 maximum flow pro...
  • 2 篇 combinatorial al...
  • 2 篇 inverse problem
  • 2 篇 lower bounds on ...
  • 2 篇 market equilibri...
  • 2 篇 generalized flow...

机构

  • 4 篇 zhejiang univ de...
  • 1 篇 univ libre bruxe...
  • 1 篇 simon fraser uni...
  • 1 篇 mit alfred p slo...
  • 1 篇 chinese univ hon...
  • 1 篇 ctr wiskunde & i...
  • 1 篇 aarhus univ dept...
  • 1 篇 swiss fed inst t...
  • 1 篇 univ warsaw inst...
  • 1 篇 tel aviv univ sc...
  • 1 篇 odc ctr cisco hc...
  • 1 篇 kyoto univ res i...
  • 1 篇 chinese acad sci...
  • 1 篇 ibm res corp alm...
  • 1 篇 city univ hong k...
  • 1 篇 univ waterloo de...
  • 1 篇 georgia inst tec...
  • 1 篇 1. computer scie...
  • 1 篇 eotvos lorand un...
  • 1 篇 chinese acad sci...

作者

  • 5 篇 liu longcheng
  • 5 篇 vegh laszlo a.
  • 2 篇 hochbaum dorit s...
  • 2 篇 sering leon
  • 2 篇 hertrich christo...
  • 2 篇 yao enyu
  • 1 篇 zhu wr
  • 1 篇 yang xg
  • 1 篇 alon tzvi
  • 1 篇 devanur nikhil r...
  • 1 篇 gorokh o.v.
  • 1 篇 punnen abraham p...
  • 1 篇 li y
  • 1 篇 shamir r
  • 1 篇 megiddo n
  • 1 篇 goldberg av
  • 1 篇 cohen e
  • 1 篇 miltersen peter ...
  • 1 篇 kuennemann marvi...
  • 1 篇 tamir a

语言

  • 32 篇 英文
检索条件"主题词=Strongly polynomial algorithms"
32 条 记 录,以下是11-20 订阅
A strongly polynomial algorithm for generalized flow maximization  14
A strongly polynomial algorithm for generalized flow maximiz...
收藏 引用
46th Annual ACM Symposium on Theory of Computing (STOC)
作者: Vegh, Laszlo A. London Sch Econ & Polit Sci Dept Management London England
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly... 详细信息
来源: 评论
Strategy Iteration Is strongly polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
收藏 引用
JOURNAL OF THE ACM 2013年 第1期60卷 1-1页
作者: Hansen, Thomas Dueholm Miltersen, Peter Bro Zwick, Uri Aarhus Univ Dept Comp Sci DK-8000 Aarhus Denmark Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel
Ye [2011] showed recently that the simplex method with Dantzig's pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount facto... 详细信息
来源: 评论
strongly polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives  12
Strongly Polynomial Algorithm for a Class of Minimum-Cost Fl...
收藏 引用
44th ACM Annual Symposium on Theory of Computing (STOC)
作者: Vegh, Laszlo A. Georgia Inst Technol Coll Comp Atlanta GA 30332 USA
A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective E-ij is an element of E C-ij(f(ij)) over feasible flows f, where on every arc ij of the network, C-ij is a convex functi... 详细信息
来源: 评论
RATIONALITY AND strongly polynomial SOLVABILITY OF EISENBERG-GALE MARKETS WITH TWO AGENTS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2010年 第3期24卷 1117-1136页
作者: Chakrabarty, Deeparnab Devanur, Nikhil R. Vazirani, Vijay V. Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Microsoft Res Redmond WA USA Georgia Tech Coll Comp Atlanta GA 30332 USA
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [K. Jain and V. V. Vazirani, Games and Economic Behavior, 70 (2010), pp. 84-106] introduced t... 详细信息
来源: 评论
Constrained inverse min-max spanning tree problems under the weighted Hamming distance
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2009年 第1期43卷 83-95页
作者: Liu, Longcheng Wang, Qin Zhejiang Univ Dept Math Hangzhou 310003 Zhejiang Peoples R China China Jiliang Univ Dept Math Hangzhou Zhejiang Peoples R China
In this paper, we consider the constrained inverse min-max spanning tree problems under the weighted Hamming distance. Three models are studied: the problem under the bottleneck-type weighted Hamming distance and two ... 详细信息
来源: 评论
A strongly polynomial simplex method for the linear fractional assignment problem
收藏 引用
OPERATIONS RESEARCH LETTERS 2008年 第4期36卷 402-407页
作者: Kabadi, Santosh N. Punnen, Abraham P. Simon Fraser Univ Dept Math Surrey BC V3T 0A3 Canada Univ New Brunswick Fac Business Adm Fredericton NB Canada
In this paper we show that the complexity of the simplex method for the linear fractional assignment problem (LFAP) is strongly polynomial. Although LFAP can be solved in polynomial time using various algorithms such ... 详细信息
来源: 评论
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1-3期396卷 28-34页
作者: Liu, Longcheng Yao, Enyu Zhejiang Univ Dept Math Hangzhou Zhejiang Peoples R China
The inverse optimization problem is to modify the weight (or cost, length, capacity and so on) such that a given feasible solution becomes an optimal solution. In this paper, we consider the inverse min-max spanning t... 详细信息
来源: 评论
Complexity and algorithms for nonlinear optimization problems
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2007年 第1期153卷 257-296页
作者: Hochbaum, Dorit S. Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Univ Calif Berkeley Walter A Haas Sch Business Berkeley CA 94720 USA
Nonlinear optimization algorithms are rarely discussed from a complexity point of view. Even the concept of solving nonlinear problems on digital computers is not well defined. The focus here is on a complexity approa... 详细信息
来源: 评论
Inverse min-max spanning tree problem under the weighted sum-type hamming distance
收藏 引用
1st International Conference on Combinatorics, algorithms, Probabilistic and Experimental Methodologies
作者: Liu, Longcheng Yao, Enyu Zhejiang Univ Dept Math Hangzhou 310027 Peoples R China
The inverse optimization problem is to modify the weight (or cost, length, capacity and so on) such that a given feasible solution becomes an optimal solution. In this paper, we consider the inverse min-max spanning t... 详细信息
来源: 评论
Inverse maximum flow problems under the weighted Hamming distance
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2006年 第4期12卷 394-407页
作者: Liu, Longcheng Zhang, Jianzhong Zhejiang Univ Dept Math Hangzhou Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China
In this paper, we consider inverse maximum flow problem under the weighted Hamming distance. Four models are studied: the problem under sum-type weighted Hamming distance;the problem under bottleneck-type weighted Ham... 详细信息
来源: 评论