• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Metaheuristic algorithms for the quadratic assignment problem

Thumbnail
Date
2013
Author
Tasgetiren, M.F.
Pan, Q.K.
Suganthan, P.N.
Dizbay, I.E.
Metadata
Show full item record
Abstract
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction procedures. The algorithm starts from an initial solution and then i
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884991420&doi=10.1109%2fCIPLS.2013.6595210&partnerID=40&md5=d62078395fed52611e13e6c7df024611
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10478
Collections
  • Scopus İndeksli Yayınlar Koleksiyonu





Creative Commons License
[email protected] by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 




| Politika | Rehber | İletişim |

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy LanguageThis CollectionBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy Language

My Account

LoginRegister

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV