BiqCrunch: Solving Binary Quadratic Problems Efficiently Using Semidefinite Optimization

Event Sponsor: 
Mathmatics and Computer Science Division Seminar - LANS
Start Date: 
Jun 20 2018 - 10:30am
Building 240/Room 1404-1405
Argonne National Laboratory
Nathan Krislock
Speaker(s) Title: 
Northern Illinois University

BiqCrunch is a branch-and-bound solver using semidefinite optimization to compute high-quality bounds for binary quadratic problems, such as MaxCut, Max-k-Cluster, Maximum-Independent-Set, Exact Quadratic Knapsack, and the Quadratic Assignment Problem. BiqCrunch does not use an interior-point method for computing its bounds. Instead, an eigenvalue solver and a gradient-based method are used to compute tight bounds. We will discuss our bounding procedure and give an update on the new features and performance enhancements of the latest version of BiqCrunch.

Miscellaneous Information: 

This seminar will be streamed. See details at

Please click here [schedule.ics] to add this event to your calendar.


June 27, 2018, "TBA" Matt Otten, Maria Goeppert Mayer Fellowship - Argonne Scholar
July 25, 2018, "SASSy Part I"
August 8, 2018, "SASSy Part II"
August 15, 2018, "TBA" Wissam M. Sid-Lakhdar, Postdoctoral Fellow, LBNL
September 19, 2018, "TBA" Emil Constantinescu, Computational Mathematician (MCS/ANL)