论文信息 - SDP diagonalizations and perspective cuts for a class of nonseparable MIQP - 字舞流文

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

Claudio Gentile | Antonio Frangioni | C. Gentile | A. Frangioni

[1] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[2] L. F. Escudero,et al. On modeling robust policies for financial trading , 1994 .

[3] Daniel Bienstock,et al. Computational study of a family of mixed-integer quadratic programming problems , 1995, Math. Program..

[4] Sebastián Ceria,et al. Convex programming for disjunctive convex optimization , 1999, Math. Program..

[5] G. Mitra,et al. Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints , 2001 .

[6] Ian C. Parmee,et al. Optimization in industry , 2002 .

[7] Claudio Gentile,et al. Perspective cuts for 0-1 mixed integer programs , 2002 .

[8] Antonio Frangioni,et al. About Lagrangian Methods in Integer Optimization , 2005, Ann. Oper. Res..

[9] Panos M. Pardalos,et al. Computational aspects of a branch and bound algorithm for quadratic zero-one programming , 1990, Computing.

[10] Claudio Gentile,et al. Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..