Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5144| Title: | A Hybrid Approach to Discrete Mathematical Programming |
| Issue Date: | 9-Oct-2013 |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Description: | 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. Supported in part by the U.S. Army Research Office (Durham) under Contract DAHC04-73-C-0032. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/5144 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.