Publication:
Two classes of quadratic assignment problems that are solvable as linear assignment problems

dc.contributor.authorErdoğan, Güneş
dc.contributor.authorTansel, B. Ç.
dc.contributor.departmentIndustrial Engineering
dc.contributor.ozuauthorERDOĞAN, Güneş
dc.date.accessioned2012-08-17T08:10:59Z
dc.date.available2012-08-17T08:10:59Z
dc.date.issued2011-08
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractThe Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes.en_US
dc.identifier.doi10.1016/j.disopt.2011.03.002
dc.identifier.endpage451
dc.identifier.issn1572-5286
dc.identifier.issue3
dc.identifier.scopus2-s2.0-79960104932
dc.identifier.startpage446
dc.identifier.urihttp://hdl.handle.net/10679/241
dc.identifier.urihttps://doi.org/10.1016/j.disopt.2011.03.002
dc.identifier.volume8
dc.identifier.wos000293931900005
dc.language.isoengen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Optimization
dc.relation.publicationcategoryInternational Refereed Journal
dc.rightsrestrictedAccess
dc.subject.keywordsQuadratic Assignment Problemen_US
dc.subject.keywordsLinear Assignment Problemen_US
dc.subject.keywordsComputational complexityen_US
dc.subject.keywordsPolynomial time solvabilityen_US
dc.titleTwo classes of quadratic assignment problems that are solvable as linear assignment problemsen_US
dc.typearticleen_US
dspace.entity.typePublication
relation.isOrgUnitOfPublication5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b
relation.isOrgUnitOfPublication.latestForDiscovery5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b

Files

License bundle

Now showing 1 - 1 of 1
Placeholder
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: