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 条

[11] The simplex method is strongly polynomial for deterministic Markov decision processes
Post, Ian
Ye, Yinyu
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1465 - 1473
[12] ON STRONGLY POLYNOMIAL VARIANTS OF THE NETWORK SIMPLEX ALGORITHM FOR THE MAXIMUM FLOW PROBLEM
GOLDFARB, D
HAO, JX
OPERATIONS RESEARCH LETTERS, 1991, 10 (07) : 383 - 387
[13] The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes
Post, Ian
Ye, Yinyu
MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (04) : 859 - 868
[14] Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs
Vaidyanathan, Balachandran
NETWORKS, 2013, 62 (02) : 136 - 148
[15] An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional Programming Problem
Das S.K.
Edalatpanah S.A.
Dash J.K.
Neutrosophic Sets and Systems, 2020, 36 : 51 - 69
[16] On optimality of a polynomial algorithm for random linear multidimensional assignment problem
Krokhmal, Pavlo A.
OPTIMIZATION LETTERS, 2011, 5 (01) : 153 - 164
[17] A COMPETITIVE (DUAL) SIMPLEX-METHOD FOR THE ASSIGNMENT PROBLEM
BALINSKI, ML
MATHEMATICAL PROGRAMMING, 1986, 34 (02) : 125 - 141
[18] On optimality of a polynomial algorithm for random linear multidimensional assignment problem
Pavlo A. Krokhmal
Optimization Letters, 2011, 5 : 153 - 164
[19] Tri-skill variant Simplex and strongly polynomial-time algorithm for linear programming
Wang, Pei-Zhuang
Guo, Si-cong
Lui, Ho-Chung
He, Jing
Kong, Qi-wei
Shi, Yong
2021 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2021), 2021, : 257 - 261
[20] The invariant polynomial assignment problem for linear periodic discrete-time systems
Jetto, L
Longhi, S
KYBERNETIKA, 1996, 32 (06) : 615 - 624

← 1 2 3 4 5 →