A Hybrid Approach to Discrete Mathematical Programming
Name
OR-051-76.pdf
Size
2.09 MB
Format
Adobe PDF
Checksum (MD5)
346592bc02e3644599b96175c03473c3
Author(s)
Marsten, Roy E.
Morin, Thomas L.
Date Issued
March 1976
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 051-76
Abstract
The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. The hybrid algorithm uses linear programming in a novel way to compute bounds and is readily extended to solve a family of parametric integer programs with related right-hand-sides. Computational experience is reported on a number of linear and nonlinear integer programs.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
