Abstract
Integer programming models, classified as NP-hard, are prevalent in the field of optimization. Often, the models are intractable and require heuristics to find reasonable solutions in a practical time-frame. In this work, we discuss three classes of integer programming models: generalized network flows with interval- flows, generalized network flows with interval-flows and fixed charges, and the topological mapping of quadratic unconstrained binary optimization (QUBO) problems to quantum computing hardware. We propose heuristics for solving those models across sets of benchmark problems and evaluate their effectiveness.
Degree Date
Fall 12-20-2025
Document Type
Dissertation
Degree Name
Ph.D.
Department
Operations Research & Engineering Management
Advisor
Dr. Richard Barr
Second Advisor
Dr. Eli Olinick
Third Advisor
Dr. Harsha Gangammanavar
Fourth Advisor
Dr. John Semple
Fifth Advisor
Dr. Angelika Leskovskaya
Number of Pages
134
Format
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 License
Recommended Citation
Huskinson, Toby, "Heuristics for Integer-Programming Problems: Interval-Flows and Fixed-Charges in Generalized Networks and Integer Reformulations for Quantum Hardware" (2025). Operations Research and Engineering Management Theses and Dissertations. 28.
https://scholar.smu.edu/engineering_managment_etds/28
