Solving the maximum edge weight clique problem via unconstrained quadratic programming [An article from: European Journal of Operational Research] | ![Solving the maximum edge weight clique problem via unconstrained quadratic programming [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: B. Alidaee, F. Glover, G. Kochenberger, H. Wang
Publisher: Elsevier
Category: Book
Buy New: $7.95
Format: Html
Media: Digital
Publication Date: August 1, 2007
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
|
|
|
