Application of Mixed-Integer Programming to Selected Military Problems
Abstract
This is a final report on a contract whose objective was to provide research support to the Concepts Analysis Agency (CAA) in the solution of large- scale mixed-integer programming models. We assisted in the formulation of a base closing model and provided a solution procedure based on a branch-and-cut algorithm. As a result of this work, we are able to solve relatively small instances of the base closing problem. Further work is needed to provide a customized algorithm that is capable of solving the larger instances in a reasonable amount of time. Integer programming.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 02, 1993
- Accession Number
- ADA276197
Entities
People
- George L. Nemhauser
Organizations
- Georgia Tech