Publisher
Springer International Publishing
Reference11 articles.
1. Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74(2), 121–140 (1996)
2. Braun, S., Mitchell, J.E.: A semidefinite programming heuristic for quadratic programming problems with complementarity constraints. Comput. Optim. Appl. 31(1), 5–29 (2005)
3. Burdakov, O.P., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J. Optim. 26(1), 397–425 (2016)
4. Frangioni, A., Gentile, C.: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35(2), 181–185 (2007)
5. Frangioni, A., Gentile, G.: Mean-variance problem with minimum buy-in constraints (2017). data and documentation. http://www.di.unipi.it/optimize/Data/MV.html