A strongly polynomial simplex method for the linear fractional assignment problem
type: Item
instance of: scholarly article
title: A strongly polynomial simplex method for the linear fractional assignment problem
zbMATH Open document ID: 1155.90456
author: Santosh N. Kabadi
author: Abraham P. Punnen
published in: Operations Research Letters
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C49
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5522977
zbMATH Keywords: assignment problem
zbMATH Keywords: linear fractional programming
zbMATH Keywords: simplex method
zbMATH Keywords: complexity
zbMATH Keywords: strongly polynomial algorithms
MaRDI profile type: Publication
full work available at URL: j.orl.2007.12.001
OpenAlex ID: W2003327511
cites work: Q3056948
cites work: The Scaling Network Simplex Algorithm
cites work: A network simplex algorithm with O(\(n\)) consecutive degenerate pivots
cites work: A genuinely polynomial primal simplex algorithm for the assignment problem
cites work: The alternating basis algorithm for assignment problems
cites work: Linear-fractional programming. Theory, methods, applications and software.
cites work: Theoretical Properties of the Network Simplex Method
cites work: On Nonlinear Fractional Programming
cites work: A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
cites work: Hyperbolic 0-1 programming and query optimization in information retrieval
cites work: Technical Note—A Polynomial Simplex Method for the Assignment Problem
cites work: Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix
cites work: Q3279740
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Q4039868
cites work: On the simplex algorithm for networks and generalized networks
cites work: A polynomial time primal network simplex algorithm for minimum cost flows
cites work: Parametric flows, weighted means of cuts, and fractional combinatorial optimization
cites work: (0, 1) hyperbolic programming problems
cites work: A new pivot selection rule for the network simplex algorithm
cites work: Q4368736
cites work: SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
cites work: An algorithm for fractional assignment problems
cites work: Upper bound problem in linear fractional functionals programming
DOI: 10.1016/J.ORL.2007.12.001
description: scientific article; zbMATH DE number 5522977