Advanced Search

A Hybrid Approach to Discrete Mathematical Programming

Research and Teaching Output of the MIT Community

Planned maintenance alert - Monday, April 21: DSpace@MIT will undergo maintenance activities that will affect service availability and access to file content. While the service interruptions should be brief, access to file content may take longer to restore. Status updates will be posted to

Show simple item record Marsten, Roy E. en_US Morin, Thomas L. en_US 2004-05-28T19:25:08Z 2004-05-28T19:25:08Z 1976-03 en_US
dc.description.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. en_US
dc.description.sponsorship Supported in part by the U.S. Army Research Office (Durham) under Contract DAHC04-73-C-0032. en_US
dc.format.extent 1746 bytes
dc.format.extent 2189896 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US en_US
dc.publisher Massachusetts Institute of Technology, Operations Research Center en_US
dc.relation.ispartofseries Operations Research Center Working Paper;OR 051-76 en_US
dc.title A Hybrid Approach to Discrete Mathematical Programming en_US
dc.type Working Paper en_US

Files in this item

Name Size Format Description
OR-051-76.pdf 2.088Mb PDF

This item appears in the following Collection(s)

Show simple item record