A sequential dual simplex algorithm for the linear assignment problem

Files

A-SEQUENTIAL-DUAL-SIMPLEX.pdf (365.72 KB)

Date

1988

Authors

Akgül, M.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
7
views
31
downloads

Citation Stats

  • Share

Series

Abstract

We present a sequential dual-simplex algorithm for the linear problem which has the same complexity as the algorithms of Balinski [3,4] and Goldfarb [8]: O(n2) pivots, O(n2 log n + nm) time. Our algorithm works with the (dual) strongly feasible trees and can handle rectangular systems quite naturally.

Source Title

Operations Research Letters

Publisher

Elsevier

Course

Other identifiers

Book Title

Keywords

Linear assignment problem, Dual-simplex, Strongly feasible trees, Polynomial algorithms

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/49601

Published Version (Please cite this version)

https://doi.org/10.1016/0167-6377(88)90082-X

Collections

Scholarly Publications - Industrial Engineering

Language

English

Type

Article