A sequential dual simplex algorithm for the linear assignment problem

Operations Research Letters

Volumn 7, Issue 3, 1988, Pages 155-158

  Akgül, Mustafa ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

dual simplex; linear assignment problem; polynomial algorithms; strongly feasible trees

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGORITHMS; OPERATIONS RESEARCH - MATHEMATICAL MODELS;

DUAL-SIMPLEX ALGORITHM; LINEAR ASSIGNMENT PROBLEM; STRONGLY FEASIBLE TREES;

MATHEMATICAL PROGRAMMING, LINEAR;

EID: 0024032520     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(88)90082-X     Document Type: Article

References (11)

1. A genuinenly polynomial primal simplex algorithm for the assignment problems
2. Variations on a theme of Balinski: Signature methods for the linear assignment problem
3. Signature method for the assignment problem
4. A competitive (dual) simplex method for the assignment problem
5. The alternating basis algorithm for assignment problem
6. A network simplex method
7. Fibonacci heaps and their uses in improved network optimization algorithms
8. Efficient dual simplex algorithms for the assignment problem