Computational study of a family of mixed-integer quadratic programming problems

被引：274
作者：
Bienstock, D
机构：
来源：
MATHEMATICAL PROGRAMMING | 1996年 / 74卷 / 02期
关键词：
branch-and-cut; mixed-integer; quadratic programming; parallel computing;
D O I：
10.1007/BF02592208
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present computational experience with a branch-and-cut algorithm to solve quadratic programming problems where there is an upper bound on the number of positive variables. Such problems arise in financial applications. The algorithm solves the largest real-life problems in a few minutes of run-time.
引用
收藏
页码：121 / 140
页数：20
相关论文
共 15 条
[1]   INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].
BALAS, E .
OPERATIONS RESEARCH, 1971, 19 (01) :19-+
[2]   A LIFT-AND-PROJECT CUTTING PLANE ALGORITHM FOR MIXED 0-1 PROGRAMS [J].
BALAS, E ;
CERIA, S ;
CORNUEJOLS, G .
MATHEMATICAL PROGRAMMING, 1993, 58 (03) :295-324
[3]  
BALAS E, IN PRESS MANAGEMENT
[4]  
BIXBY R, 1994, UNPUB PARALLEL MIXED
[5]  
BIXBY R, COMMUNICATION
[6]  
COOK WR, COMMUNICATION
[7]  
ECKSTEIN J, 1994, SIAM J OPTIMIZ, V4, P794
[8]  
Fletcher R., 1981, Practical methods of optimization, volume 2, Constrained Optimization, V2
[9]  
KONNO H, 1991, 9132 I HUM SOC SCI T
[10]  
Luenberger D. G., 2015, Linear and nonlinear programming, V4th
12