A competitive (dual) simplex method for the assignment problem

Mathematical Programming

Volumn 34, Issue 2, 1986, Pages 125-141

  Balinski, M L ^a,b  

^a ECOLE POLYTECHNIQUE   (France)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

Assignment Problem; Average Behavior; Dual Method; Linear Programming; Pivoting; Signature; Simplex Method

Indexed keywords

ASSIGNMENT PROBLEM; DUAL METHOD; PIVOTING; SIMPLEX METHOD;

MATHEMATICAL PROGRAMMING, LINEAR;

EID: 0022676208     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01580579     Document Type: Article

References (12)

1. Signature methods for the assignment problem
2. Signatures des points extrêmes du polyhèdres dual du problème de transport
3. The Hirsch conjecture for dual transportation polyhedra
4. Faces of dual transportation polyhedra
5. The alternating path basis algorithm for assignment problems
6. A network simplex method
7. Theoretical properties of the network simplex method
8. Theoretical improvements in algorithmic efficiency for network flow problems
9. Efficient dual simplex methods for the assignment problem
10. A polynomial simplex method for the assignment problem