Show simple item record

dc.contributor.authorErdoğan, Güneş
dc.contributor.authorTansel, B. Ç.
dc.date.accessioned2012-08-17T08:10:59Z
dc.date.available2012-08-17T08:10:59Z
dc.date.issued2011-08
dc.identifier.issn1572-5286
dc.identifier.urihttp://hdl.handle.net/10679/241
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S1572528611000168
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.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Optimization
dc.rightsrestrictedAccess
dc.titleTwo classes of quadratic assignment problems that are solvable as linear assignment problemsen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID172715
dc.contributor.ozuauthorErdoğan, Güneş
dc.identifier.volume8
dc.identifier.issue3
dc.identifier.startpage446
dc.identifier.endpage451
dc.identifier.wosWOS:000293931900005
dc.identifier.doi10.1016/j.disopt.2011.03.002
dc.subject.keywordsQuadratic Assignment Problemen_US
dc.subject.keywordsLinear Assignment Problemen_US
dc.subject.keywordsComputational complexityen_US
dc.subject.keywordsPolynomial time solvabilityen_US
dc.identifier.scopusSCOPUS:2-s2.0-79960104932


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page