On lower bounds for a class of quadratic 0, 1 programs

Authors:
Arjang A Assad;Weixuan Xu
Affiliations:
College of Business and Management, University of Maryland, College Park, MD 20742, USA;Institute of Applied Mathematics, Academia Sinica, Beijing, People's Republic of China
Venue:
Operations Research Letters
Year:
1985

Citing 0
Cited 2

Some applications of nonnegative linear systems: Farkas strikes again

Operations Research Letters
The minimum cost perfect matching problem with conflict pair constraints

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new method of obtaining lower bounds for a class of quadratic 0, 1 programs that includes the quadratic assignment problem. The method generates a monotonic sequence of lower bounds and may be interpreted as a Lagrangean dual ascent procedure. We report on a computational comparison of our bounds with earlier work in [2] based on subgradient techniques.