Solving the maximum edge weight clique problem via unconstrained quadratic programming |
| |
| Authors: | Bahram Alidaee Fred Glover Gary Kochenberger Haibo Wang |
| |
| Institution: | 1. School of Business, University of Mississippi, United States;2. University of Colorado at Boulder, United States;3. School of Business, University of Colorado at Denver, CO, United States;4. College of Business Administration, Texas A&M International University, United States |
| |
| 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. |
| |
| Keywords: | Metaheuristics Combinatorial optimization Integer programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
