Premium
A parametric‐based heuristic program for the quadratic assignment problem
Author(s) -
White D. J.
Publication year - 1993
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199306)40:4<553::aid-nav3220400409>3.0.co;2-z
Subject(s) - heuristic , extension (predicate logic) , quadratic equation , mathematical optimization , embedding , parametric statistics , quadratic assignment problem , metric (unit) , computation , property (philosophy) , consistent heuristic , mathematics , computer science , heuristics , quadratic programming , algorithm , optimization problem , incremental heuristic search , search algorithm , artificial intelligence , statistics , operations management , philosophy , beam search , epistemology , economics , programming language , geometry
In this article we study the quadratic assignment problem by embedding the actual data in a data space which satisfies an extension of the metric triangle property. This leads to simpler computations for the determination of heuristic solutions. Bounds are given for the loss of optimality which such heuristic solutions would involve in any specific instance. © 1993 John Wiley & Sons, Inc.