{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:41:57Z","timestamp":1725514917840},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_13","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"171-185","source":"Crossref","is-referenced-by-count":2,"title":["Best-First AND\/OR Search for 0\/1 Integer Programming"],"prefix":"10.1007","author":[{"given":"Radu","family":"Marinescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Dechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Marinescu, R., Dechter, R.: Memory intensive branch-and-bound search for graphical models. In: National Conference on Artificial Intelligence, AAAI\u201906 (2006)"},{"key":"13_CR2","volume-title":"Integer and combinatorial optimization.","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley, Chichester (1988)"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E. Lawler","year":"1966","unstructured":"Lawler, E., Wood, D.: Branch-and-bound methods: A survey. Operations Research\u00a014(4), 699\u2013719 (1966)","journal-title":"Operations Research"},{"key":"13_CR4","unstructured":"Dechter, R., Mateescu, R.: And\/or search spaces for graphical models. Artificial Intelligence (2006)"},{"key":"13_CR5","unstructured":"Marinescu, R., Dechter, R.: And\/or branch-and-bound for graphical models. In: International Joint Conference on Artificial Intelligence (IJCAI\u201905), pp. 224\u2013229 (2005)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11757375_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"R. Marinescu","year":"2006","unstructured":"Marinescu, R., Dechter, R.: And\/or branch-and-bound search for pure 0\/1 integer linear programming problems. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 152\u2013166. Springer, Heidelberg (2006)"},{"key":"13_CR7","unstructured":"Marinescu, R., Dechter, R.: Dynamic orderings for and\/or branch-and-bound search in graphical models. In: European Conference on Artificial Intelligence (ECAI\u201906), pp. 138\u2013142 (2006)"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of a*. Journal of ACM\u00a032(3), 505\u2013536 (1985)","journal-title":"Journal of ACM"},{"key":"13_CR9","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. Activity Analysis of Production and Allocation (1951)"},{"key":"13_CR10","unstructured":"Vasquez, M., Hao, J.: A hybrid approach for the 0\/1 multidimensional knapsack approach. In: International Joint Conference on Artificial Intelligence (IJCAI\u201901), pp. 328\u2013333 (2001)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"369","DOI":"10.2307\/3009639","volume":"30","author":"W. Shih","year":"1979","unstructured":"Shih, W.: A branch-and-bound method for the multiconstraint 0\/1 knapsack problem. Journal of the Operational Research Society\u00a030, 369\u2013378 (1979)","journal-title":"Journal of the Operational Research Society"},{"key":"13_CR12","first-page":"215","volume":"31","author":"B. Gavish","year":"1982","unstructured":"Gavish, B., Pirkul, H.: Allocation of data bases and processors in a distributed computing system. Management of Distributed Data Processing\u00a031, 215\u2013231 (1982)","journal-title":"Management of Distributed Data Processing"},{"key":"13_CR13","unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: International Joint Conference on Artificial Intelligence (IJCAI\u201999), pp. 542\u2013547 (1999)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM Electronic Commerce, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Joy, S., Mitchell, J., Borchers, B.: A branch and cut algorithm for max-sat and weighted max-sat. In: Satisfiability Problem: Theory and Applications, pp. 519\u2013536 (1997)","DOI":"10.1090\/dimacs\/035\/13"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1007\/978-3-540-30201-8_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"Z. Xing","year":"2004","unstructured":"Xing, Z., Zhang, W.: Efficient strategies for (Weighted) maximum satisfiability. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 690\u2013705. Springer, Heidelberg (2004)"},{"key":"13_CR17","unstructured":"Freuder, E., Quinn, M.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: International Joint Conference on Artificial Intelligence (IJCAI\u201985), pp. 1076\u20131078 (1985)"},{"issue":"1-2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(00)00069-2","volume":"126","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: Recursive conditioning. Artificial Intelligence\u00a0126(1-2), 5\u201341 (2001)","journal-title":"Artificial Intelligence"},{"key":"13_CR19","volume-title":"Principles of Artificial Intelligence.","author":"K. Nillson","year":"1980","unstructured":"Nillson, K.: Principles of Artificial Intelligence. Tioga, Palo Alto (1980)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-540-45193-8_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"S. Givry de","year":"2003","unstructured":"de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving max-SAT as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 363\u2013376. Springer, Heidelberg (2003)"},{"key":"13_CR21","unstructured":"Aloul, F., Ramani, A., Markov, I., Sakallah, K.: Pbs: A backtrack search pseudo-boolean solver. In: Symposium on the Theory and Applications of Satisfiability Testing, SAT\u201902 (2002)"},{"issue":"41","key":"13_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","volume":"3","author":"P. Chakrabati","year":"1989","unstructured":"Chakrabati, P., Ghose, S., Acharya, A., de Sarkar, S.: Heuristic search in restricted memory. Artificial Intelligence\u00a03(41), 197\u2013221 (1989)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:07:48Z","timestamp":1550387268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}