|
|||||
|
|
The unconstrained binary quadratic programming problem: a survey |
|
| Authors: | Gary Kochenberger Jin-Kao Hao Fred Glover Mark Lewis Zhipeng Lü Haibo Wang Yang Wang |
| Affiliation: | 1. School of Business Administration, University of Colorado at Denver, Denver, CO?, 80217, USA 2. LERIA, Université d’Angers, 2 Boulevard Lavoisier, 49045?, Angers, France 3. OptTek Inc., Boulder, CO?, 80302, USA 4. Craig School of Business, Missouri Western State University, Saint Joseph, MO?, 64507, USA 5. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan?, 430074, China 6. Sanchez School of Business, Texas A&M International University, Laredo, TX?, 78041, USA 7. School of Management, Northwestern Polytechnical University, 127 Youyi West Road, Xi’an?, 710072, China |
| Abstract: | In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paper we survey the literature on this important model, providing an overview of the applications and solution methods. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |