Paper Info
Title
An infeasible (exterior point) simplex algorithm for assignment problems
Abstract
The so called Modified Hung—Rom Algorithm, based upon theoretical considerations of Hirsch-paths, seems to be one of the most efficient algorithms for assignment problems. Since any two basic feasible solutions to a linear problem can always be connected with a short simplex path passing through the infeasible region, development of algorithms based upon theoretical considerations on infeasible paths seems to be of great practical interest. This paper presents an algorithm of this kind for assignment problems.
Year
DOI
Venue
1991
10.1007/BF01586925
Math. Program.
Keywords
Field
DocType
pivoting.,dual and primal simplex method,assignment problem,simplex algorithm,exterior point,signatures,infeasible simplex method,simplex method
Linear problem,Mathematical optimization,Tree (graph theory),Simplex algorithm,Algorithm complexity,Algorithm,Simplex,Assignment problem,Mathematics
Journal
Volume
Issue
ISSN
51
1
0025-5610
Citations 
PageRank 
References 
19
1.21
8
Authors
1
Name
Order
Citations
PageRank
Konstantinos Paparrizos117817.95