Loading...
research article
An evolutionary heuristic for quadratic 0-1 programming
In this paper we present a heuristic algorithm for the well- known Unconstrained Quadratic 0–1 Programming Problem. The approach is based on combining solutions in a genetic paradigm and incorporates intensification algorithms used to improve solutions and speed up the method. Extensive computational experiments on instances with up to 500 variables are presented and we compare our approach both with powerful heuristic and exact algorithms from the literature establishing the effectiveness of the method in terms of solutions quality and computing time.
Type
research article
Web of Science ID
WOS:000083202000007
Authors
Publication date
1999
Published in
Volume
119
Issue
3
Start page
662
End page
670
Note
PRO 99.04
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record