A note on a polynomial time solvable case of the quadratic assignment problem

Simple item page
dc.citation.epage384en_US
dc.citation.issueNumber4en_US
dc.citation.spage382en_US
dc.citation.volumeNumber3en_US
dc.contributor.authorErdoǧan, G.en_US
dc.contributor.authorTansel, B.en_US
dc.date.accessioned2016-02-08T10:16:49Z
dc.date.available2016-02-08T10:16:49Z
dc.date.issued2006en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe identify a class of instances of the Koopmans-Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:16:49Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2006en
dc.identifier.doi10.1016/j.disopt.2006.04.001en_US
dc.identifier.eissn1873-636X
dc.identifier.issn1572-5286
dc.identifier.urihttp://hdl.handle.net/11693/23641
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.disopt.2006.04.001en_US
dc.source.titleDiscrete Optimizationen_US
dc.subjectQuadratic assignment problemen_US
dc.subjectSolvabilityen_US
dc.titleA note on a polynomial time solvable case of the quadratic assignment problemen_US
dc.typeArticleen_US

Files

Original bundle

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

Collections

Scholarly Publications - Industrial Engineering