• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

The quadratic assignment problem: special cases and relatives (1995)

by Eranda Çela
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

THIS PAGE INTENTIONALLY LEFT BLANK

by Shawn M. Phillips, Second Reader, Stephen H. Mount , 2009
"... by ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

... n locations.sThe general QAP is known to be NP-complete [15,s16].sBurkard, et al. [17] identify special cases of the QAP having polynomial-timessolutions.sAdditionally, Burkard, et al. [17-20], Cela =-=[21, 22]-=-, and most recentlysDemidenko [23] in 2006 prove a small number of special cases of the QAP having notsonly polynomial-time solutions, but solutions that can be expressed in closed-form (soscalled “ea...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University