A strongly polynomial simplex method for the linear fractional assignment problem

被引：11

作者：

Kabadi, Santosh N. ^{[2
]}

Punnen, Abraham P. ^{[1
]}

机构：

[1] Simon Fraser Univ, Dept Math, Surrey, BC V3T 0A3, Canada

[2] Univ New Brunswick, Fac Business Adm, Fredericton, NB, Canada

来源：

OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 04期

基金：

加拿大自然科学与工程研究理事会;

关键词：

assignment problem; linear fractional programming; simplex method; complexity; strongly polynomial algorithms;

D O I：

10.1016/j.orl.2007.12.001

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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 as Newton's method or binary search, no polynomial time bound for the simplex method for LFAP is known. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：402 / 407

页数：6

共 50 条

[21] On a variant of the simplex method for a linear semidefinite programming problem
Zhadan, V. G.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2015, 21 (03): : 117 - 127
[22] Strongly polynomial simplex algorithm for bipartite vertex packing
Armstrong, RD
Jin, ZY
DISCRETE APPLIED MATHEMATICS, 1996, 64 (02) : 97 - 103
[23] New strongly polynomial dual network simplex algorithm
Armstrong, Ronald D.
Jin, Zhiying
Mathematical Programming, Series B, 1997, 78 (02): : 131 - 148
[24] A new strongly polynomial dual network simplex algorithm
Ronald D. Armstrong
Zhiying Jin
Mathematical Programming, 1997, 78 : 131 - 148
[25] New polynomial time method for a linear complementarity problem
Mizuno, Shinji
Mathematical Programming, Series A, 1992, 56 (01): : 31 - 43
[26] A new strongly polynomial dual network simplex algorithm
Armstrong, RD
Jin, ZY
MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 131 - 148
[27] A STRONGLY POLYNOMIAL ALGORITHM FOR THE TRANSPORTATION PROBLEM
KLEINSCHMIDT, P
SCHANNATH, H
MATHEMATICAL PROGRAMMING, 1995, 68 (01) : 1 - 13
[28] The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
Ye, Yinyu
MATHEMATICS OF OPERATIONS RESEARCH, 2011, 36 (04) : 593 - 603
[29] A NON-DUAL SIGNATURE METHOD FOR THE ASSIGNMENT PROBLEM AND A GENERALIZATION OF THE DUAL SIMPLEX-METHOD FOR THE TRANSPORTATION PROBLEM
PAPARRIZOS, K
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1988, 22 (03): : 269 - 289
[30] Polynomial-time simplex method for the maximum k-flow problem
Wagner, Donald K., 1600, (60):

← 1 2 3 4 5 →