A Decomposition Procedure for the Quadratic Assignment Problem,

Abstract

The Quadratic Assignment Problem is one of many combinatorial optimization problems encountered in operations research where the relationship between the computational running time of the available algorithm and problem size is an increasing polynomial. The paper presents a decomposition procedure for reducing the running time of large QAPs. The procedure incorporates the N-step, 2-variable search algorithm. Running time reductions as well as improved solution values are demonstrated for the Steinberg test problem. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1972
Accession Number
AD0751215

Entities

People

  • Charles H. Heider

Organizations

  • Center for Naval Analyses

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Decomposition
  • Heuristic Methods
  • Interdisciplinary Science
  • Mathematics
  • Operations Research
  • Optimization
  • Polynomials
  • Systems Science

Readers

  • Operations Research