QUANTITATIVE BOUNDS FOR CUTTING PLANE AND ENUMERATION TECHNIQUES IN MIXED-INTEGER OPTIMIZATION
Abstract
The project will develop new theoretical foundations for key procedures used in mixed-integer optimization (MIO) and propose tools to enhance existing methods based on the insights gained. If successful, these insights will provide much needed rigorous bounds on the efficacy of traditional methods in MIO, with a careful mathematical analysis of their strengths and weaknesses. Apart from contributing to a long and rich line of work on MIO, the proposal will develop new techniques to further improve state-of-the-art software for solving MIO models. Advances made will have impact in diverse application areas such as computational game theory applied to national security and defense, chemical engineering, astronomical data analysis, and “smart” cities initiatives, amongst many others.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Aug 12, 2021
- Source ID
- FA95502010341
Entities
People
- Amitabh Basu
Organizations
- Air Force Office of Scientific Research
- Johns Hopkins University
- United States Air Force