A polyhedral approach to quadratic assignment problem

Date

1994

Editor(s)

Advisor

Akgül, Mustafa

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
8
downloads

Series

Abstract

In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of solutions to Quadratic Assignment Problems has been limited to instances of small dimension. In this study, Quadratic Assignment Problem is handled from a polyhedral point of view. A graph theoretic formulation of the problem is presented. Later, Quadratic Assignment Polytope is defined and subsets of valid equalities and inequalities for Quadratic Assignment Polytope is given. Finally, results of the experiments with a polyhedral cutting plane algorithm using the new formulation is also presented.

Source Title

Publisher

Course

Other identifiers

Book Title

Degree Discipline

Industrial Engineering

Degree Level

Master's

Degree Name

MS (Master of Science)

Citation

Published Version (Please cite this version)

Language

English

Type