Abstract
The principal idea of this paper is to exploit Semidefinite Programming (SDP) relaxation within the framework provided by Mixed Integer Nonlinear Programming (MINLP) solvers when tackling Binary Quadratic Problems. We included the SDP relaxation in a state-of-the-art MINLP solver as an additional bounding technique and demonstrated that this idea could be computationally useful. The Quadratic Stable Set Problem is adopted as the case study. The tests indicate that the Hybrid SDP Bounding Procedure allows an average 50% cut of the overall computing time and a cut of more than one order of magnitude for the branching nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2-3), 471–484 (2009)
BARON (2012), http://archimedes.cheme.cmu.edu/?q=baron
BiqCrunch (2012), http://www-lipn.univ-paris13.fr/BiqCrunch/
Bonmin (2012), https://projects.coin-or.org/Bonmin
Borchers, B.: CSDP, A C library for semidefinite programming. Optim. Methods Softw. 11, 613–623 (1999)
Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comp. Optim. Appl. 43, 181–195 (2009)
Cplex (2012), http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
Giandomenico, M., Letchford, A.N., Rossi, F., Smriglio, S.: A new approach to the stable set problem based on ellipsoids. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 223–234. Springer, Heidelberg (2011)
Gurobi (2012), http://www.gurobi.com/
Jaumard, B., Marcotte, O., Meyer, C.: Estimation of the Quality of Cellular Networks Using Column Generation Techniques. Cahiers du GÉRAD (1998)
Jaumard, B., Marcotte, O., Meyer, C., Vovor, T.: Comparison of column generation models for channel assignment in cellular networks. Discrete Appl. Math. 112(1-3), 217–240 (2001)
Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. To appear in Math. Prog. (2013)
Mahdavi Pajouh, F., Balasundaram, B., Prokopyev, O.: On characterization of maximal independent sets via quadratic optimization. J. Heuristics, 1–16 (2011)
Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Prog. 121, 307–335 (2010)
SeDuMi (2012), http://sedumi.ie.lehigh.edu/
Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Springer (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furini, F., Traversi, E. (2013). Hybrid SDP Bounding Procedure. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)