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.issued2017
dc.identifier.issn1382-6905
dc.identifier.doi10.1007/s10878-015-9979-2
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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherSpringer Netherlands
dc.relation.ispartofpagefrom1
dc.relation.ispartofpageto16
dc.relation.ispartofjournalJournal of Combinatorial Optimization
dc.subject.fieldofresearchApplied Mathematics not elsewhere classified
dc.subject.fieldofresearchPure Mathematics
dc.subject.fieldofresearchApplied Mathematics
dc.subject.fieldofresearchNumerical and Computational Mathematics
dc.subject.fieldofresearchcode010299
dc.subject.fieldofresearchcode0101
dc.subject.fieldofresearchcode0102
dc.subject.fieldofresearchcode0103
dc.titleA heuristic for the time constrained asymmetric linear sum assignment problem
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
dc.description.versionPost-print
gro.facultyGriffith Sciences, Griffith Institute for Drug Discovery
gro.description.notepublicThis publication has been entered into Griffith Research Online as an Advanced Online Version.
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.
gro.hasfulltextFull Text
gro.griffith.authorPullan, Wayne J.
gro.griffith.authorBrown, Peter
gro.griffith.authorZhou, Yaoqi
gro.griffith.authorYang, Yuedong


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