Solving the quadratic assignment problem using F-MSG algorithm
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, cilt.3, sa.2, ss.173-191, 2007 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 3 Sayı: 2
- Basım Tarihi: 2007
- Doi Numarası: 10.3934/jimo.2007.3.173
- Dergi Adı: JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.173-191
- Eskişehir Osmangazi Üniversitesi Adresli: Hayır
Özet
Quadratic assignment problems are one of the famous strongly NP-hard combinatorial optimization problems. Because of the wide area of applications and the difficulties existing in finding optimal solutions, these problems are one of the most common objects for application of optimization methods. This paper examines the use of a generalized version of the modified subgradient algorithm for solving quadratic assignment problems. Promising computational results are reported for benchmark problem instances taken from the quadratic assignment problem library - QAPLIB.