skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube

Abstract

In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs.Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n{sup 3} log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.

Authors:
 [1];  [2];  [3]
  1. Department of Mathematics, Arizona State University, Tempe, AZ 85287-1804 (United States)
  2. Department of Industrial and Enterprise System Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, 61801 (United States)
  3. Department of Electrical and Computer Engineering, McMaster University, Ontario (Canada)
Publication Date:
OSTI Identifier:
21316827
Resource Type:
Journal Article
Journal Name:
AIP Conference Proceedings
Additional Journal Information:
Journal Volume: 1146; Journal Issue: 1; Conference: CMETP: International conference on modelling and engineering and technological problems; 9. biennial national conference of Indian Society of Industrial and Applied Mathematics (ISIAM), Agra (India), 14-16 Jan 2009; Other Information: DOI: 10.1063/1.3183570; (c) 2009 American Institute of Physics; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 0094-243X
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGEBRA; DATA TRANSMISSION; FUNCTIONAL ANALYSIS; GEOMETRY; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL SOLUTIONS; MATRICES; NUMERICAL ANALYSIS; RELAXATION; SIMULATION; SPACE; SYMMETRY

Citation Formats

Mittelmann, Hans, Jiming, Peng, and Xiaolin, Wu. Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube. United States: N. p., 2009. Web. doi:10.1063/1.3183570.
Mittelmann, Hans, Jiming, Peng, & Xiaolin, Wu. Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube. United States. https://doi.org/10.1063/1.3183570
Mittelmann, Hans, Jiming, Peng, and Xiaolin, Wu. 2009. "Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube". United States. https://doi.org/10.1063/1.3183570.
@article{osti_21316827,
title = {Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube},
author = {Mittelmann, Hans and Jiming, Peng and Xiaolin, Wu},
abstractNote = {In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs.Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n{sup 3} log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.},
doi = {10.1063/1.3183570},
url = {https://www.osti.gov/biblio/21316827}, journal = {AIP Conference Proceedings},
issn = {0094-243X},
number = 1,
volume = 1146,
place = {United States},
year = {Thu Jul 02 00:00:00 EDT 2009},
month = {Thu Jul 02 00:00:00 EDT 2009}
}