✦ LIBER ✦

Efficient dual simplex algorithms for the assignment problem

✍ Scribed by D. Goldfarb

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 913 KB
Volume: 33
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582245

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient dual simplex algorithms for th

Efficient dual simplex algorithms for the assignment problem

✍ D. Goldfarb 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 20 KB

A sequential dual simplex algorithm for

A sequential dual simplex algorithm for the linear assignment problem

✍ Mustafa Akgül 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 406 KB

A sequential dual simplex algorithm for

A sequential dual simplex algorithm for the linear assignment problem

✍ Mustafa Akgül 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 32 KB

A competitive (dual) simplex method for

A competitive (dual) simplex method for the assignment problem

✍ M. L. Balinski 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 839 KB

An infeasible (exterior point) simplex a

An infeasible (exterior point) simplex algorithm for assignment problems

✍ Konstantinos Paparrizos 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 511 KB

A simple dual algorithm for the generali

A simple dual algorithm for the generalised assignment problem

✍ John M. Wilson 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 415 KB

A new algorithm for the generalised assignment problem is described in this paper. The dual-type algorithm uses a simple heuristic derived from a relaxation of the problem. The algorithm has been tested on generalised assignment problems of substantial size and compared to an exact integer programmi