The unconstrained binary quadratic programming problem: a survey

被引：0
作者：
Gary Kochenberger
Jin-Kao Hao
Fred Glover
Mark Lewis
Zhipeng Lü
Haibo Wang
Yang Wang
机构：
[1] University of Colorado at Denver,School of Business Administration
[2] Université d’Angers,LERIA
[3] OptTek Inc.,Craig School of Business
[4] Missouri Western State University,School of Computer Science and Technology
[5] Huazhong University of Science and Technology,Sanchez School of Business
[6] Texas A&M International University,School of Management
[7] Northwestern Polytechnical University,undefined
来源：
Journal of Combinatorial Optimization | 2014年 / 28卷
关键词：
Unconstrained binary quadratic programs; Combinatorial optimization; Metaheuristics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：58 / 81
页数：23
相关论文
共 222 条
  • [1] Alidaee B(2005)A new modeling and solution approach for the number partitioning problem J Appl Math Decis Sci 2005 113-121
  • [2] Glover F(2008)A new approach for modeling and solving set packing problems Eur J Oper Res 186 504-512
  • [3] Kochenberger GA(1994)0–1 Quadratic programming approach for optimum solutions of two scheduling problems Int J Syst Sci 25 401-408
  • [4] Rego C(1998)Simulated annealing for the unconstrained quadratic pseudo-Boolean function Eur J Oper Res 108 641-652
  • [5] Alidaee B(1986)A solvable case of quadratic 0–1 programming Discret Appl Math 13 23-26
  • [6] Kochenberger G(1988)An application of combinatorial optimization to statistical Oper Res 36 493-137
  • [7] Lewis K(1989)Experiments in quadratic 0–1 programming Math Program 44 127-188
  • [8] Lewis M(2000)Global optimality conditions for quadratic optimization problems with binary constraints SIAM J Optim 11 179-68
  • [9] Wang H(2007)Using a mixed integer quadratic programming solver for the unconstrained quadratic 0–1 problem Math Program 109 55-115
  • [10] Alidaee B(1994)Minimization of a quadratic pseudo-Boolean function Eur J Oper Res 78 106-180
12345678910