| dc.contributor.author | de la Banda, MG | |
| dc.contributor.author | Stuckey, PJ | |
| dc.date.available | 2014-05-21T22:50:18Z | |
| dc.date.issued | 2007-09-01 | |
| dc.identifier | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000251037100013&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c | |
| dc.identifier.citation | de la Banda, M. G. & Stuckey, P. J. (2007). Dynamic programming to minimize the maximum number of open stacks. INFORMS JOURNAL ON COMPUTING, 19 (4), pp.607-617. https://doi.org/10.1287/ijoc.1060.0205. | |
| dc.identifier.issn | 1091-9856 | |
| dc.identifier.uri | http://hdl.handle.net/11343/29286 | |
| dc.language | English | |
| dc.publisher | INFORMS | |
| dc.subject | Artificial Intelligence and Image Processing | |
| dc.title | Dynamic programming to minimize the maximum number of open stacks | |
| dc.type | Journal Article | |
| dc.identifier.doi | 10.1287/ijoc.1060.0205 | |
| melbourne.peerreview | Peer Reviewed | |
| melbourne.affiliation | The University of Melbourne | |
| melbourne.affiliation.department | Computer Science and Software Engineering | |
| melbourne.source.title | Informs Journal on Computing | |
| melbourne.source.volume | 19 | |
| melbourne.source.issue | 4 | |
| melbourne.source.pages | 607-617 | |
| dc.description.pagestart | 607 | |
| melbourne.publicationid | 85478 | |
| melbourne.elementsid | 293429 | |
| melbourne.contributor.author | Stuckey, Peter | |
| melbourne.internal.ingestnote | Abstract bulk upload (2017-07-20) | |
| dc.identifier.eissn | 1526-5528 | |
| melbourne.accessrights | This item is currently not available from this repository | |
