Show simple item record

dc.contributor.authorBrown, Peter
dc.contributor.authorYang, Yuedong
dc.contributor.authorZhou, Yaoqi
dc.contributor.authorPullan, Wayne
dc.date.accessioned2018-10-29T03:27:41Z
dc.date.available2018-10-29T03:27:41Z
dc.date.issued2015
dc.identifier.issn1573-2886en_US
dc.identifier.doi10.1007/s10878-015-9979-2en_US
dc.identifier.urihttp://hdl.handle.net/10072/101924
dc.description.abstractThe linear sum assignment problem is a fundamental combinatorial optimisation problem and can be broadly defined as: given an n×m,m≥n benefit matrix B=(bij) , matching each row to a different column so that the sum of entries at the row-column intersections is maximised. This paper describes the application of a new fast heuristic algorithm, Asymmetric Greedy Search, to the asymmetric version ( n≠m ) of the linear sum assignment problem. Extensive computational experiments, using a range of model graphs demonstrate the effectiveness of the algorithm. The heuristic was also incorporated within an algorithm for the non-sequential protein structure matching problem where non-sequential alignment between two proteins, normally of different numbers of amino acids, needs to be maximised.en_US
dc.description.peerreviewedYesen_US
dc.languageEnglishen_US
dc.publisherSpringer Netherlandsen_US
dc.relation.ispartofpagefrom1en_US
dc.relation.ispartofpageto16en_US
dc.relation.ispartofjournalJournal of Combinatorial Optimizationen_US
dc.subject.fieldofresearchApplied Mathematics not elsewhere classifieden_US
dc.subject.fieldofresearchcode010299en_US
dc.titleA heuristic for the time constrained asymmetric linear sum assignment problemen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
dc.description.versionPost-printen_US
gro.facultyGriffith Sciences, Griffith Institute for Drug Discoveryen_US
gro.description.notepublicThis publication has been entered into Griffith Research Online as an Advanced Online Version.en_US
gro.rights.copyright© 2017 Springer US. This is an electronic version of an article published in Journal of Combinatorial Optimization, 2017, Volume 33, Issue 2, pp 551–566. Journal of Combinatorial Optimization is available online at: http://link.springer.com/ with the open URL of your article.en_US
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record