{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:22:02Z","timestamp":1648790522821},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,4,24]],"date-time":"2008-04-24T00:00:00Z","timestamp":1208995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10479-008-0350-1","type":"journal-article","created":{"date-parts":[[2008,4,23]],"date-time":"2008-04-23T15:07:17Z","timestamp":1208963237000},"page":"255-270","source":"Crossref","is-referenced-by-count":2,"title":["Optimization problems involving collections of dependent objects"],"prefix":"10.1007","volume":"163","author":[{"given":"David L.","family":"Roberts","sequence":"first","affiliation":[]},{"suffix":"Jr.","given":"Charles L.","family":"Isbell","sequence":"additional","affiliation":[]},{"given":"Michael L.","family":"Littman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,24]]},"reference":[{"key":"350_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/322609.322650","volume-title":"Proceedings of the 1988 ACM sixteenth annual conference on computer science","author":"P. P. Chakrabarti","year":"1988","unstructured":"Chakrabarti, P. P., Ghose, S., & DeSarkar, S. C. (1988). Best first search in and\/or graphs. In Proceedings of the 1988 ACM sixteenth annual conference on computer science (pp. 256\u2013261). New York: Assoc. Comput. Mech."},{"key":"350_CR2","unstructured":"Das, S., & Kamenica, E. (2005). Two-sided bandits and the dating market. In Proceedings of the international joint conference on artificial intelligence (IJCAI-05) (pp. 947\u2013952)."},{"key":"350_CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-45655-4_27","volume-title":"Computing and combinatorics: 8th annual international conference","author":"Y. Desmedt","year":"2002","unstructured":"Desmedt, Y., & Wang, Y. (2002). Maximum flows and critical vertices in and\/or graphs. In Computing and combinatorics: 8th annual international conference (pp. 238\u2013248). Berlin: Springer."},{"key":"350_CR4","doi-asserted-by":"crossref","unstructured":"Dignum, V., & Dignum, F. (2005). Task and social coordination in agent organizations. In Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (pp. 1183\u20131184).","DOI":"10.1145\/1082473.1082684"},{"key":"350_CR5","unstructured":"Faltings, B., & Nguyen, Q. H. (2005). Multi-agent coordination using local search. In Proceedings of the international joint conference on artificial intelligence (IJCAI-05) (pp. 953\u2013958)."},{"key":"350_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/51909.51926","volume-title":"IEA\/AIE \u201988: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems","author":"R. Feldman","year":"1988","unstructured":"Feldman, R. (1988). Design of a dependency-directed compiler for constraint propagation. In IEA\/AIE \u201988: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems (pp. 141\u2013146). New York: Assoc. Comput. Mech."},{"key":"350_CR7","volume-title":"Computers and intractability: A guide to the theory of np-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of np-completeness. New York: Freeman."},{"key":"350_CR8","volume-title":"The stable marriage problem: structure and algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., & Irving, R. W. (1989). The stable marriage problem: structure and algorithms. Cambridge: MIT Press."},{"key":"350_CR9","doi-asserted-by":"crossref","unstructured":"Hunsberger, L. (2005). A framework for specifying group decision-making mechanisms. In Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (pp. 1191\u20131192).","DOI":"10.1145\/1082473.1082688"},{"key":"350_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s00779-004-0273-z","volume":"3","author":"C. Isbell","year":"2004","unstructured":"Isbell, C., Omojokun, O., & Pierce, J. (2004). From devices to tasks: Automatic task prediction for personalized appliance control. Personal and Ubiquitous Computing, 3, 146\u2013153.","journal-title":"Personal and Ubiquitous Computing"},{"key":"350_CR11","unstructured":"Kann, V. (2003). Maximum edge subgraph. In A compendium of NP optimization problems. \n                    http:\/\/www.ensta.fr\/~diam\/\/ro\/online\/viggo_wwwcompendium\/node46.html\n                    \n                  ."},{"key":"350_CR12","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/IPPS.1998.669967","volume-title":"Proceedings of the first merged international conference and symposium on parallel and distributed processing","author":"Y.-K. Kwok","year":"1998","unstructured":"Kwok, Y.-K., & Ahmad, I. (1998). Benchmarking the task graph scheduling algorithms. In Proceedings of the first merged international conference and symposium on parallel and distributed processing (pp.\u00a0531\u2013537). New York: IEEE Press."},{"issue":"1","key":"350_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/2455.2459","volume":"32","author":"A. Mahanti","year":"1985","unstructured":"Mahanti, A., & Bagchi, A. (1985). And\/or graph heuristic search methods. Journal of the ACM, 32(1), 28\u201351.","journal-title":"Journal of the ACM"},{"key":"350_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"W. McCulloch","year":"1943","unstructured":"McCulloch, W., & Pitts, W. (1943). A logical calculus of ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, 5, 115\u2013133.","journal-title":"Bulletin of Mathematical Biophysics"},{"key":"350_CR15","volume-title":"Principles of artificial intelligence","author":"N. J. Nilsson","year":"1980","unstructured":"Nilsson, N. J. (1980). Principles of artificial intelligence. San Mateo: Morgan Kaufmann."},{"key":"350_CR16","unstructured":"Pearce, J. P., Maheswaran, R. T., & Tambe, M. (2004). Dcop games for multi-agent coordination. In CP 2004 workshop on distributed constraint reasoning (DCR-04)."},{"key":"350_CR17","doi-asserted-by":"crossref","unstructured":"Roberts, D. L., Bhat, S., Isbell, C. L., Cooper, B. F., & Pierce, J. S. (2006). A decision-theoretic approach to file consistency in constrained peer-to-peer device networks. In Proceedings of the fifth international joint conference on autonomous agents and multiagent systems. Hakodate, Japan.","DOI":"10.1145\/1160633.1160693"},{"key":"350_CR18","first-page":"849","volume-title":"IEEE transactions of parallel and distributed systems","author":"D. Zhu","year":"2004","unstructured":"Zhu, D., Moss\u00e9, D., & Melhem, R. (2004). Power-aware scheduling for and\/or graphs in real-time systems. In IEEE transactions of parallel and distributed systems (pp. 849\u2013864). Los Alamitos: IEEE Comput.\u00a0Soc."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0350-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0350-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0350-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0350-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T04:01:05Z","timestamp":1581998465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0350-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,24]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0350-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,24]]}}}