Author:
Quintero Rodolfo A.,Zuluaga Luis F.
Publisher
Springer International Publishing
Reference62 articles.
1. Abello J, Butenko S, Pardalos PM, Resende MG (2001) Finding independent sets in a graph using continuous multivariable polynomial formulations. J Glob Optim 21(2):111–137
2. Atamtürk A, Narayanan V (2007) Cuts for conic mixed-integer programming. In: International Conference on Integer Programming and Combinatorial Optimization. Springer, pp 16–29
3. Bliek C, Bonami P, Lodi A (2014) Solving mixed-integer quadratic programming problems with IBM-CPLEX: a progress report. In: Proceedings of the Twenty-Sixth RAMP Symposium, pp 16–17
4. Bradley GH, Hammer PL, Wolsey L (1974) Coefficient reduction for inequalities in 0–1 variables. Math Program 7(1):263–282
5. Brandao FGL, Kueng R, França DS (2022) Faster quantum and classical SDP approximations for quadratic binary optimization. Quantum 6:625