Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A New Lower Bound for the Quadratic Assignment Problem

Paolo Carraresi and Federico Malucelli
Operations Research
Vol. 40, Supplement 1: Optimization (Jan. - Feb., 1992), pp. S22-S27
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3840832
Page Count: 6
  • Download ($30.00)
  • Cite this Item
A New Lower Bound for the Quadratic Assignment Problem
Preview not available

Abstract

We introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. We present a procedure for obtaining tight bounds by sequentially applying our approach in conjunction with the A. Assad and W. Xu bound and the N. Christofides and M. Gerrard bound.

Page Thumbnails

  • Thumbnail: Page 
S22
    S22
  • Thumbnail: Page 
S23
    S23
  • Thumbnail: Page 
S24
    S24
  • Thumbnail: Page 
S25
    S25
  • Thumbnail: Page 
S26
    S26
  • Thumbnail: Page 
S27
    S27