The linear assignment problem
| dc.citation.epage | 122 | en_US |
| dc.citation.spage | 85 | en_US |
| dc.citation.volumeNumber | 82 | en_US |
| dc.contributor.author | Akgül, Mustafa | en_US |
| dc.contributor.editor | Akgül, Mustafa | |
| dc.contributor.editor | Hamacher, H. W. | |
| dc.contributor.editor | Tüfekçi, S. | |
| dc.coverage.spatial | Ankara, Turkey | en_US |
| dc.date.accessioned | 2019-07-23T11:58:59Z | |
| dc.date.available | 2019-07-23T11:58:59Z | |
| dc.date.issued | 1992 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description | Conference Name: NATO Advanced Study Institute on New Frontiers in the Theory and Practice of Combinatorial Optimization | en_US |
| dc.description | Date of Conference: 16-29 July 1990 | en_US |
| dc.description | Chapter 5 | en_US |
| dc.description.abstract | We present a broad survey of recent polynomial algorithms for the linear assignment problem. They all use essentially alternating trees and/or strongly feasible trees. Most of them employ Dijkstra’s shortest path algorithm directly or indirectly. When properly implemented, each has the same complexity: O (n 3) for dense graphs with simple data structures and O (n 2 log n+nm) for sparse graphs using Fibonacci Heaps. | en_US |
| dc.description.provenance | Submitted by Zeynep Aykut (zeynepay@bilkent.edu.tr) on 2019-07-23T11:58:59Z No. of bitstreams: 1 The_linear_assignment_problem.pdf: 4852076 bytes, checksum: 380a107d5246fb6ad06085fd966e1792 (MD5) | en |
| dc.description.provenance | Made available in DSpace on 2019-07-23T11:58:59Z (GMT). No. of bitstreams: 1 The_linear_assignment_problem.pdf: 4852076 bytes, checksum: 380a107d5246fb6ad06085fd966e1792 (MD5) Previous issue date: 1992 | en |
| dc.identifier.doi | 10.1007/978-3-642-77489-8_5 | en_US |
| dc.identifier.doi | 10.1007/978-3-642-77489-8 | en_US |
| dc.identifier.eisbn | 9783642774898 | |
| dc.identifier.isbn | 9783642774911 | |
| dc.identifier.uri | http://hdl.handle.net/11693/52282 | |
| dc.language.iso | English | en_US |
| dc.publisher | Springer | en_US |
| dc.relation.ispartof | Combinatorial optimization: new frontiers in theory and practice | en_US |
| dc.relation.ispartofseries | NATO ASI Series F: Computer and Systems Sciences; 82 | |
| dc.relation.isversionof | https://doi.org/10.1007/978-3-642-77489-8_5 | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/978-3-642-77489-8 | en_US |
| dc.subject | Source node | en_US |
| dc.subject | Assignment problem | en_US |
| dc.subject | Sink node | en_US |
| dc.subject | Short path problem | en_US |
| dc.subject | Short path algorithm | en_US |
| dc.title | The linear assignment problem | en_US |
| dc.type | Conference Paper | en_US |