Publication Date
2020
Document Type
Dissertation/Thesis
First Advisor
Krislock, Nathan
Degree Name
M.S. (Master of Science)
Legacy Department
Department of Mathematical Sciences
Abstract
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.
Recommended Citation
Mackelfresh, William Cody, "A Computational Study of Binary Linear and Quadratic Programming and Solvers" (2020). Graduate Research Theses & Dissertations. 7389.
https://huskiecommons.lib.niu.edu/allgraduate-thesesdissertations/7389
Extent
39 pages
Language
eng
Publisher
Northern Illinois University
Rights Statement
In Copyright
Rights Statement 2
NIU theses are protected by copyright. They may be viewed from Huskie Commons for any purpose, but reproduction or distribution in any format is prohibited without the written permission of the authors.
Media Type
Text
