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 条
  • [71] Gupta SK(2010)An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs J Global Optim 48 595-1272
  • [72] Mittal AK(1976)Maximal closure of a graph and applications to combinatorial problems Manag Sci 22 1268-440
  • [73] Hammer P(2004)Sufficient global optimality conditions for bivalent quadratic optimization J Optim Theory Appl 122 433-626
  • [74] Shlifer E(1971)Cluster analysis and mathematical programming J Am Stat Assoc 66 622-207
  • [75] Hanafi S(1970)A selection problem of shared fixed costs and network flows Manag Sci 17 200-897
  • [76] Rebai AR(2011)Systems analysis solving unconstrained binary quadratic programming problem by global equilibrium search Cybern Syst Anal 47 889-269
  • [77] Vasquez M(2012)On duality gap in binary quadratic programming J Global Optim 53 255-548
  • [78] Hansen P(2013)Metaheuristics for robust graph coloring J Heuristics 19 529-77
  • [79] Hansen P(2006)Solving group technology problems via clique partitioning Int J Flex Manuf Syst 18 77-14881
  • [80] Jaumard B(2011)Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem Expert Syst Appl 38 14870-604
3456789101112