Solving Nearby Integer Programs.
Abstract
Two elementary principles are provided for rapidly obtaining efficient solutions to integer programs that are 'nearby' a given integer program, in the sense that the right-hand-sides can often be made near the given right-hand-side. These results also supply a sensitivity analysis for integer programs.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 26, 1976
- Accession Number
- ADA025606
Entities
People
- Robert G. Jeroslow
Organizations
- Carnegie Mellon University