On linearization techniques for budget-constrained binary quadratic programming problems

Abstract Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the recent two linearizations for (BBQP), it not only provides a tighter relaxation at the root node, but also has a much better computational performance for globally solving (BBQP).

[1]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[2]  W. Art Chaovalitwongse,et al.  A new linearization technique for multi-quadratic 0-1 programming problems , 2004, Oper. Res. Lett..

[3]  Hanif D. Sherali,et al.  Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems , 1990, Oper. Res..

[4]  Lawrence J. Watters.  Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[5]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[6]  W. Art Chaovalitwongse,et al.  An improved linearization technique for a class of quadratic 0-1 programming problems , 2012, Optim. Lett..

[7]  Leonidas D. Iasemidis,et al.  Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures , 2001, J. Comb. Optim..

[8]  David Pisinger,et al.  Upper bounds and exact algorithms for p-dispersion problems , 2006, Comput. Oper. Res..

[9]  Panos M. Pardalos,et al.  Construction of test problems in quadratic bivalent programming , 1991, TOMS.

[10]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[11]  Fred W. Glover,et al.  Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems , 1973, Oper. Res..

[12]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[13]  Willard I. Zangwill,et al.  Media Selection by Decision Programming , 1976 .

[14]  Lawrence J. Watters,et al.  REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS , 2016 .

[15]  E. Erkut.  The discrete p-dispersion problem , 1990 .

[16]  Hanif D. Sherali,et al.  An improved linearization strategy for zero-one quadratic programming problems , 2006, Optim. Lett..

[17]  Ya-Xiang Yuan,et al.  A new linearization method for quadratic assignment problems , 2006, Optim. Methods Softw..