Show simple item record

dc.contributor.authorde la Banda, MG
dc.contributor.authorStuckey, PJ
dc.date.available2014-05-21T22:50:18Z
dc.date.issued2007-09-01
dc.identifierhttp://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.citationde 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.issn1091-9856
dc.identifier.urihttp://hdl.handle.net/11343/29286
dc.languageEnglish
dc.publisherINFORMS
dc.subjectArtificial Intelligence and Image Processing
dc.titleDynamic programming to minimize the maximum number of open stacks
dc.typeJournal Article
dc.identifier.doi10.1287/ijoc.1060.0205
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science and Software Engineering
melbourne.source.titleInforms Journal on Computing
melbourne.source.volume19
melbourne.source.issue4
melbourne.source.pages607-617
dc.description.pagestart607
melbourne.publicationid85478
melbourne.elementsid293429
melbourne.contributor.authorStuckey, Peter
melbourne.internal.ingestnoteAbstract bulk upload (2017-07-20)
dc.identifier.eissn1526-5528
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record