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

Erdoğan, Güneş; Tansel, B. Ç.

dc.contributor.author	Erdoğan, Güneş
dc.contributor.author	Tansel, B. Ç.
dc.date.accessioned	2012-08-17T08:10:59Z
dc.date.available	2012-08-17T08:10:59Z
dc.date.issued	2011-08
dc.identifier.issn	1572-5286
dc.identifier.uri	http://hdl.handle.net/10679/241
dc.identifier.uri	http://www.sciencedirect.com/science/article/pii/S1572528611000168
dc.description	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstract	The 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.iso	eng	en_US
dc.publisher	Elsevier	en_US
dc.relation.ispartof	Discrete Optimization
dc.rights	restrictedAccess
dc.title	Two classes of quadratic assignment problems that are solvable as linear assignment problems	en_US
dc.type	Article	en_US
dc.peerreviewed	yes	en_US
dc.publicationstatus	published	en_US
dc.contributor.department	Özyeğin University
dc.contributor.authorID	(ORCID 0000-0002-2456-3719 & YÖK ID 172715) Erdoğan, Güneş
dc.contributor.ozuauthor	Erdoğan, Güneş
dc.identifier.volume	8
dc.identifier.issue	3
dc.identifier.startpage	446
dc.identifier.endpage	451
dc.identifier.wos	WOS:000293931900005
dc.identifier.doi	10.1016/j.disopt.2011.03.002
dc.subject.keywords	Quadratic Assignment Problem	en_US
dc.subject.keywords	Linear Assignment Problem	en_US
dc.subject.keywords	Computational complexity	en_US
dc.subject.keywords	Polynomial time solvability	en_US
dc.identifier.scopus	SCOPUS:2-s2.0-79960104932
dc.contributor.authorMale	1
dc.relation.publicationcategory	Article - International Refereed Journal - Institutional Academic Staff