Back to search
Clemson University
On the Computation of a Tight Lower Bound for the Quadratic Assignment Problem
Abstract
dc:description.abstractIn this paper, we are concerned with developing solution strategies for a specially-structured zero-one quadratic programming problem referred to as the Quadratic Assignment Problem (QAP).
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Jayne, Lisa
- Contributors dc:contributor
-
- Warren P. Aeleum
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/arv_theses/135