Show simple item record

dc.contributor.authorAkgül, Mustafaen_US
dc.contributor.editorAkgül, Mustafa
dc.contributor.editorHamacher, H. W.
dc.contributor.editorTüfekçi, S.
dc.coverage.spatialAnkara, Turkeyen_US
dc.date.accessioned2019-07-23T11:58:59Z
dc.date.available2019-07-23T11:58:59Z
dc.date.issued1992en_US
dc.identifier.isbn9783642774911
dc.identifier.urihttp://hdl.handle.net/11693/52282
dc.descriptionConference Name: NATO Advanced Study Institute on New Frontiers in the Theory and Practice of Combinatorial Optimizationen_US
dc.descriptionDate of Conference: 16-29 July 1990en_US
dc.descriptionChapter 5en_US
dc.description.abstractWe 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.language.isoEnglishen_US
dc.relation.ispartofCombinatorial optimization: new frontiers in theory and practiceen_US
dc.relation.ispartofseriesNATO ASI Series F: Computer and Systems Sciences; 82
dc.relation.isversionofhttps://doi.org/10.1007/978-3-642-77489-8_5en_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-642-77489-8en_US
dc.subjectSource nodeen_US
dc.subjectAssignment problemen_US
dc.subjectSink nodeen_US
dc.subjectShort path problemen_US
dc.subjectShort path algorithmen_US
dc.titleThe linear assignment problemen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage85en_US
dc.citation.epage122en_US
dc.citation.volumeNumber82en_US
dc.identifier.doi10.1007/978-3-642-77489-8_5en_US
dc.identifier.doi10.1007/978-3-642-77489-8en_US
dc.publisherSpringeren_US
dc.identifier.eisbn9783642774898


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record