Adaptive Memory Tabu Search for Binary Quadratic Programs

Fred Glover, Gary A. Kochenberger and Bahram Alidaee
Additional contact information
Fred Glover: Graduate School of Business, University of Colorado at Boulder, Boulder, Colorado 80309
Gary A. Kochenberger: College of Business, University of Colorado at Denver, Denver, Colorado 80217-3364
Bahram Alidaee: College of Business, University of Mississippi, University, Mississippi 38677

Management Science, 1998, vol. 44, issue 3, 336-345

Abstract: Recent studies have demonstrated the effectiveness of applying adaptive memory tabu search procedures to combinatorial optimization problems. In this paper we describe the development and use of such an approach to solve binary quadratic programs. Computational experience is reported, showing that the approach optimally solves the most difficult problems reported in the literature. For challenging problems of limited size, which are capable of being approached by exact procedures, we find optimal solutions considerably faster than the best reported exact method. Moreover, we demonstrate that our approach is significantly more efficient and yields better solutions than the best heuristic method reported to date. Finally, we give outcomes for larger problems that are considerably more challenging than any currently reported in the literature.

Keywords: Integer Programming; Heuristics; Nonlinear Optimization (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.44.3.336 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:44:y:1998:i:3:p:336-345

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().