Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5144Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Marsten, Roy E. | - |
| dc.creator | Morin, Thomas L. | - |
| dc.date | 2004-05-28T19:25:08Z | - |
| dc.date | 2004-05-28T19:25:08Z | - |
| dc.date | 1976-03 | - |
| dc.date.accessioned | 2013-10-09T02:37:58Z | - |
| dc.date.available | 2013-10-09T02:37:58Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5144 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.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. | - |
| dc.description | Supported in part by the U.S. Army Research Office (Durham) under Contract DAHC04-73-C-0032. | - |
| dc.format | 1746 bytes | - |
| dc.format | 2189896 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | - |
| dc.relation | Operations Research Center Working Paper;OR 051-76 | - |
| dc.title | A Hybrid Approach to Discrete Mathematical Programming | - |
| dc.type | Working Paper | - |
| 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.