{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T07:18:57Z","timestamp":1693379937264},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2017edp7109","type":"journal-article","created":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T22:26:22Z","timestamp":1512080782000},"page":"2945-2952","source":"Crossref","is-referenced-by-count":1,"title":["BDD-Constrained A&lt;sup&gt;*&lt;\/sup&gt; Search: A Fast Method for Solving Constrained Shortest-Path Problems"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Fumito","family":"TAKEUCHI","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"NISHINO","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norihito","family":"YASUDA","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"AKIBA","sequence":"additional","affiliation":[{"name":"Preferred Networks Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"MINATO","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"NAGATA","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] T. Yamada, S. Kataoka, and K. Watanabe, \u201cHeuristic and exact algorithms for the disjunctively constrained knapsack problem,\u201d Information Processing Society of Japan Journal, vol.43, no.9, pp.2864-2870, 2002."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] B. Morgenstern, S.J. Prohaska, D. P\u00f6hler, and P.F. Stadler, \u201cMultiple sequence alignment with user-defined anchor points,\u201d Algorithms for Molecular Biology, vol.1, no.1, p.6, 2006. 10.1186\/1748-7188-1-6","DOI":"10.1186\/1748-7188-1-6"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] M.-W. Chang, L. Ratinov, and D. Roth, \u201cStructured learning with constrained conditional models,\u201d Mach. Learn., vol.88, no.3, pp.399-431, Sept. 2012. 10.1007\/s10994-012-5296-5","DOI":"10.1007\/s10994-012-5296-5"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S.B. Akers, \u201cBinary decision diagrams,\u201d IEEE Trans. Comput., vol.C-27, no.6, pp.509-516, 1978. 10.1109\/tc.1978.1675141","DOI":"10.1109\/TC.1978.1675141"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] R.E. Bryant, \u201cGraph-based algorithms for boolean function manipulation,\u201d IEEE Trans. Comput., vol.C-35, no.8, pp.677-691, 1986. 10.1109\/tc.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"6","unstructured":"[6] M. Nishino, N. Yasuda, S. Minato, and M. Nagata, \u201cBDD-constrained search: A unified approach to constrained shortest path problems,\u201d Proc. AAAI, pp.1219-1225, 2015."},{"key":"7","unstructured":"[7] D.E. Knuth, The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks &amp; Techniques; Binary Decision Diagrams, Addison-Wesley Professional, 2009."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] M. Hifi and M. Michrafy, \u201cA reactive local search-based algorithm for the disjunctively constrained knapsack problem,\u201d Journal of the Operational Research Society, vol.57, no.6, pp.718-726, 2006. 10.1057\/palgrave.jors.2602046","DOI":"10.1057\/palgrave.jors.2602046"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] G.Y. Handler and I. Zang, \u201cA dual algorithm for the constrained shortest path problem,\u201d Networks, vol.10, no.4, pp.293-309, 1980. 10.1002\/net.3230100403","DOI":"10.1002\/net.3230100403"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Santos, J. Coutinho-Rodrigues, and J.R. Current, \u201cAn improved solution algorithm for the constrained shortest path problem,\u201d Transportation Research Part B: Methodological, vol.41, no.7, pp.756-771, 2007. 10.1016\/j.trb.2006.12.001","DOI":"10.1016\/j.trb.2006.12.001"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] X. Zhu and W.E. Wilhelm, \u201cA three-stage approach for the resource-constrained shortest path as a sub-problem in column generation,\u201d Computers &amp; Operations Research, vol.39, no.2, pp.164-178, 2012. 10.1016\/j.cor.2011.03.008","DOI":"10.1016\/j.cor.2011.03.008"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] L.D.P. Pugliese and F. Guerriero, \u201cA survey of resource constrained shortest path problems: Exact solution approaches,\u201d Networks, vol.62, no.3, pp.183-200, 2013. 10.1002\/net.21511","DOI":"10.1002\/net.21511"},{"key":"13","unstructured":"[13] G. Liu and K.G. Ramakrishnan, \u201cA<sup>*<\/sup> prune: an algorithm for finding <i>k<\/i> shortest paths subject to multiple constraints,\u201d Proc. INFOCOM, pp.743-749, 2001. 10.1109\/infcom.2001.916263"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] S. Edelkamp and F. Reffel, \u201cOBDDs in heuristic search,\u201d Proc. KI, vol.1504, pp.81-92, 1998. 10.1007\/bfb0095430","DOI":"10.1007\/BFb0095430"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] \u00c1. Torralba and V. Alc\u00e1zar, \u201cConstrained symbolic search: On mutexes, BDD minimization and more,\u201d Proc. SOCS, pp.175-183, 2013.","DOI":"10.1609\/socs.v4i1.18285"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/12\/E100.D_2017EDP7109\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T15:17:41Z","timestamp":1693322261000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/12\/E100.D_2017EDP7109\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017edp7109","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}