A competitive (dual) simplex method for the assignment problem

Publisher Website

1 March 1986

journal article
Published by Springer Nature in Mathematical Programming

Vol. 34 (2), 125-141
https://doi.org/10.1007/bf01580579

Abstract

No abstract available

Keywords

This publication has 9 references indexed in Scilit:

Efficient dual simplex algorithms for the assignment problem
Mathematical Programming, 1985
Signature Methods for the Assignment Problem
Operations Research, 1985
The Hirsch Conjecture for Dual Transportation Polyhedra
Mathematics of Operations Research, 1984
Faces of dual transportation polyhedra
Published by Springer Nature ,1984
Technical Note—A Polynomial Simplex Method for the Assignment Problem
Operations Research, 1983
Theoretical Properties of the Network Simplex Method
Mathematics of Operations Research, 1979
The alternating basis algorithm for assignment problems
Mathematical Programming, 1977
A network simplex method
Mathematical Programming, 1976
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM, 1972

Cited by 59 articles