Experiments in a Multiple Choice Mixed Integer Programming Algorithm.
Abstract
This paper deals with experimental modifications to the mixed integer branch-and-bound algorithm of Beale and Tomlin. Their algorithm uses the multiple choice structure to dichotomize, not on an individual bivalent variable, but on a subset of variables in a multiple choice class. Partitioning in this manner has proven to be an effective method to obtain more balance penalties and accelerate convergence. The modifications proposed here involve deriving new penalties by enforcing the integer restriction on different combinations of variables and reordering variables within a multiple choice class in an attempt to force an integer solution.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1975
- Accession Number
- ADA008360
Entities
People
- R. D. Armstrong
Organizations
- University of Texas at Austin