{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:43:41Z","timestamp":1648691021308},"reference-count":11,"publisher":"Informa UK Limited","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Systems Science"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1080\/00207720412331297901","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T14:30:46Z","timestamp":1206455446000},"page":"629-636","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic programming and lower-bound approaches to the minimum binding problem"],"prefix":"10.1080","volume":"35","author":[{"given":"S.","family":"Kataoka","sequence":"first","affiliation":[]},{"given":"M.","family":"Kajiya","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"CIT0002","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0003","unstructured":"Kajiya , M. 2001 , The algorithms for minimum binding problem and the view to the large scale problem Master's thesis National Defense Academy [in Japanese]."},{"key":"CIT0004","unstructured":"Kajiya , M. , and Kataoka , S 2000a , The dynamic programming approach to the minimum binding problem In 2000 Spring: Proceedings in Operations Research Society in Japan, 26\u201327 D (in Japanese) ."},{"key":"CIT0005","unstructured":"Kajiya , M. , and Kataoka , S. 2000b , The lower-bound procedure for the minimum binding problem [in Japanese] . In 2000 Fall: Proceedings in Operations Research Society in Japan , pp. 26 \u2013 27 ."},{"key":"CIT0006","unstructured":"Kajiya , M. , Kataoka , S. , and Sakamori , Y. 2001 , Improving lower-bound and branch-and-bound algorithm for the minimum binding problem [in Japanese] In 2001 Spring: Proceedings in Operations Research Society in Japan , pp. 204 \u2013 205 ."},{"key":"CIT0007","unstructured":"Kataoka , S. , and Tokunaga , K. 1996 , Minimum stay problem(l) [in Japanese] . In 1996 Spring: Proceedings in Operations Research Society in Japan , pp. 58 \u2013 59 ."},{"key":"CIT0008","volume-title":"Combinatorial Optmization \u2014 Short collection [in Japanese]","author":"Kubo M.","year":"1999"},{"key":"CIT0009","first-page":"270","volume":"16","author":"Papadimitriou C. H.","year":"1976","journal-title":"Computing, , 263"},{"key":"CIT0010","unstructured":"Tokunaga , K. , Kataoka , S. , Imaizumi , J. , and Morito , S. 1996 , Minimum stay problem(2) [in Japanese] In 1996 Spring: Proceedings in Operations Research Society in Japan , pp. 60 \u2013 61 ."},{"key":"CIT0011","volume-title":"Integer Programming","author":"Wolsey L. A.","year":"1998"}],"container-title":["International Journal of Systems Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207720412331297901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T09:34:54Z","timestamp":1481708094000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207720412331297901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":11,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1080\/00207720412331297901"],"URL":"https:\/\/doi.org\/10.1080\/00207720412331297901","relation":{},"ISSN":["0020-7721","1464-5319"],"issn-type":[{"value":"0020-7721","type":"print"},{"value":"1464-5319","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}