Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem
暂无分享,去创建一个
[1] D. J. Laughhunn. Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..
[2] Fred W. Glover,et al. Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..
[3] F. Glover. IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .
[4] Mathematical methods of site selection for Electronic Message Systems (EMS) , 1975 .
[5] P. Hammer,et al. Quadratic knapsack problems , 1980 .
[6] Warren Philip Adams. The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs , 1985 .
[7] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[8] Muhittin Oral,et al. A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems , 1992, Oper. Res..
[9] Hanif D. Sherali,et al. Mixed-integer bilinear programming problems , 1993, Math. Program..
[10] George L. Nemhauser,et al. Min-cut clustering , 1993, Math. Program..
[11] Warren P. Adams,et al. Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem , 1993, Quadratic Assignment and Related Problems.
[12] Han-Lin Li. Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions , 1994 .
[13] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[14] Sungsoo Park,et al. An extended formulation approach to the edge-weighted maximal clique problem , 1996 .
[15] Hanif D. Sherali,et al. Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems , 1998, Oper. Res..
[16] Paolo Toth,et al. Exact Solution of the Quadratic Knapsack Problem , 1999, INFORMS J. Comput..
[17] Ching-Ter Chang,et al. A linearization method for mixed 0-1 polynomial programs , 2000, Comput. Oper. Res..
[18] Ching-Ter Chang,et al. An efficient linearization approach for mixed-integer problems , 2000, Eur. J. Oper. Res..
[19] W. Art Chaovalitwongse,et al. A new linearization technique for multi-quadratic 0-1 programming problems , 2004, Oper. Res. Lett..
[20] Fred W. Glover,et al. Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs , 2004, Discret. Optim..
[21] R. Lougee-Heimer,et al. A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs , 2005, Ann. Oper. Res..
[22] Warren P. Adams,et al. A simple recipe for concise mixed 0-1 linearizations , 2005, Oper. Res. Lett..
[23] Hanif D. Sherali,et al. An improved linearization strategy for zero-one quadratic programming problems , 2006, Optim. Lett..
[24] David Pisinger,et al. The quadratic knapsack problem - a survey , 2007, Discret. Appl. Math..
[25] Warren P. Adams,et al. Linear forms of nonlinear expressions: New insights on old ideas , 2007, Oper. Res. Lett..
[26] David Pisinger,et al. Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction , 2007, INFORMS J. Comput..
[27] Monique Guignard-Spielberg,et al. A level-2 reformulation-linearization technique bound for the quadratic assignment problem , 2007, Eur. J. Oper. Res..
[28] Alberto Caprara,et al. Constrained 0-1 quadratic programming: Basic approaches and extensions , 2008, Eur. J. Oper. Res..