Solving the quadratic assignment problem using F-MSG algorithm

R. N. Gasimov; O. Ustun

doi:10.3934/jimo.2007.3.173

Article Contents

2007, Volume 3, Issue 2: 173-191. Doi: 10.3934/jimo.2007.3.173

This issue Previous Article A class of gap functions for quasi-variational inequality problems Next Article Construction of aggregation operators for automated decision making via optimal interpolation and global optimization

Solving the quadratic assignment problem using F-MSG algorithm

R. N. Gasimov^1, and
O. Ustun^1,

1.
Eskişehir Osmangazi University, Department of Industrial Engineering, Bademlik 26030, Eskişehir

Received: August 2006

Revised: November 2006

Published: April 2007

Abstract / Introduction Related Papers Cited by

Abstract

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.

Keywords:

Mathematics Subject Classification: Primary: 90B80, 90C20; secondary: 90C26, 90C56.

Citation:

Article Metrics

HTML views() PDF downloads(445) Cited by(0)

Solving the quadratic assignment problem using F-MSG algorithm

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Solving the quadratic assignment problem using F-MSG algorithm

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content