A sequential dual simplex algorithm for the linear assignment problem

dc.citation.epage	158	en_US
dc.citation.issueNumber	3	en_US
dc.citation.spage	155	en_US
dc.citation.volumeNumber	7	en_US
dc.contributor.author	Akgül, M.	en_US
dc.date.accessioned	2019-02-19T11:47:18Z
dc.date.available	2019-02-19T11:47:18Z
dc.date.issued	1988	en_US
dc.department	Department of Industrial Engineering	en_US
dc.description.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.	en_US
dc.identifier.doi	10.1016/0167-6377(88)90082-X	en_US
dc.identifier.eissn	1872-7468
dc.identifier.issn	0167-6377
dc.identifier.uri	http://hdl.handle.net/11693/49601
dc.language.iso	English	en_US
dc.publisher	Elsevier	en_US
dc.relation.isversionof	https://doi.org/10.1016/0167-6377(88)90082-X	en_US
dc.source.title	Operations Research Letters	en_US
dc.subject	Linear assignment problem	en_US
dc.subject	Dual-simplex	en_US
dc.subject	Strongly feasible trees	en_US
dc.subject	Polynomial algorithms	en_US
dc.title	A sequential dual simplex algorithm for the linear assignment problem	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1