Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Mathematics
A Computational Study Of Binary Linear And Quadratic Programming And Solvers, William Cody Mackelfresh
A Computational Study Of Binary Linear And Quadratic Programming And Solvers, William Cody Mackelfresh
Graduate Research Theses & Dissertations
In this thesis we study and compare computational capability of two solvers, Gurobi and BiqCrunch, and their capabilities to solve various binary quadratic and linear programming problems. We review two types of programming models for three types of combinatorial optimization problems, namely Max-Cut, Max Independent Set, and Max-$k$-Cluster. We also review the Reformulation-Linearization Technique (RLT) and Semidefinite Programming (SDP) approaches for solving these models, go over the software and hardware used to solve these problems, and finally review the numerical results obtained by solving the problems.