Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
479106 | European Journal of Operational Research | 2007 | 6 Pages |
Abstract
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more traditional methods. In this paper we report on the application of UQP to the maximum edge-weighted clique problem. Computational experience is reported illustrating the attractiveness of the approach.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Bahram Alidaee, Fred Glover, Gary Kochenberger, Haibo Wang,