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

Simple item page
dc.citation.epage451en_US
dc.citation.issueNumber3en_US
dc.citation.spage446en_US
dc.citation.volumeNumber8en_US
dc.contributor.authorErdoǧan, G.en_US
dc.contributor.authorTansel, B. Ç.en_US
dc.date.accessioned2016-02-08T09:51:47Z
dc.date.available2016-02-08T09:51:47Z
dc.date.issued2011en_US
dc.departmentDepartment of Industrial Engineeringen_US
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.description.provenanceMade available in DSpace on 2016-02-08T09:51:47Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2011en
dc.identifier.doi10.1016/j.disopt.2011.03.002en_US
dc.identifier.eissn1873-636X
dc.identifier.issn1572-5286
dc.identifier.urihttp://hdl.handle.net/11693/21836
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.disopt.2011.03.002en_US
dc.source.titleDiscrete Optimizationen_US
dc.subjectQuadratic Assignment Problemen_US
dc.subjectLinear Assignment Problemen_US
dc.subjectComputational complexityen_US
dc.subjectPolynomial time solvabilityen_US
dc.titleTwo classes of quadratic assignment problems that are solvable as linear assignment problemsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Two_classes_of_quadratic_pssignment_problems_that_are_solvable_as_linear_assignment_problems.pdf
Size:
646.72 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering