{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:34:54Z","timestamp":1743125694658,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_31","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"463-477","source":"Crossref","is-referenced-by-count":12,"title":["Quantified Constraint Optimization"],"prefix":"10.1007","author":[{"given":"Marco","family":"Benedetti","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Lallouet","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Vautard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/11564751_66","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"P. Nightingale","year":"2005","unstructured":"Nightingale, P.: Consistency for quantified constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 792\u2013796. Springer, Heidelberg (2005)"},{"key":"31_CR2","unstructured":"Bessi\u00e8re, C., Verger, G.: Strategic constraint satisfaction problems. In: Miguel, I., Prestwich, S. (eds.) Workshop on Constraint Modelling and Reformulation, Nantes, France, pp. 17\u201329 (2006)"},{"key":"31_CR3","first-page":"38","volume-title":"International Joint Conference on Artificial Intelligence, Hyderabad, India","author":"M. Benedetti","year":"2007","unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: QCSP Made Practical by Virtue of Restricted Quantification. In: Veloso, M. (ed.) International Joint Conference on Artificial Intelligence, Hyderabad, India, pp. 38\u201343. AAAI Press, Menlo Park (2007)"},{"key":"31_CR4","volume-title":"ACM Symposium on Applied Computing, Fortaleza, Brazil","author":"M. Benedetti","year":"2008","unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: Modeling adversary scheduling with QCSP+. In: ACM Symposium on Applied Computing, Fortaleza, Brazil. ACM Press, New York (2008)"},{"key":"31_CR5","unstructured":"Nightingale, P.: Consistency and the Quantified Constraint Satisfaction Problem. PhD thesis, University of St Andrews (2007)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J. Bracken","year":"1973","unstructured":"Bracken, J., McGill, J.: Mathematical programs with optimization problems in the constraints. Operations Research\u00a021, 37\u201344 (1973)","journal-title":"Operations Research"},{"key":"31_CR7","volume-title":"The theory of market economy","author":"H. Stackelberg","year":"1952","unstructured":"Stackelberg, H.: The theory of market economy. Oxford University Press, Oxford (1952)"},{"key":"31_CR8","unstructured":"Bialas, W.F.: Multilevel mathematical programming, an introduction. Slides (2002)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B. Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Annals of Operations Research\u00a0153, 235\u2013256 (2007)","journal-title":"Annals of Operations Research"},{"key":"31_CR10","unstructured":"QeCode Team: QeCode: An open QCSP+ solver (2008), http:\/\/www.univ-orleans.fr\/lifo\/software\/qecode\/"},{"key":"31_CR11","unstructured":"Gecode Team: Gecode: Generic constraint development environment (2006), \n                      http:\/\/www.gecode.org"},{"key":"31_CR12","unstructured":"Benedetti, M.: Extracting certificates from quantified boolean formulas. In: Kaelbling, L.P., Saffiotti, A. (eds.) International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, pp. 47\u201353. Professional Book Center (2005)"},{"key":"31_CR13","first-page":"360","volume-title":"National Conference on Artificial Intelligence","author":"L. Bordeaux","year":"2005","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: Definitions and complexity. In: Veloso, M.M., Kambhampati, S. (eds.) National Conference on Artificial Intelligence, pp. 360\u2013365. AAAI Press, Menlo Park (2005)"},{"key":"31_CR14","unstructured":"Walsh, T.: Stochastic constraint programming. In: ECAI, pp. 111\u2013115 (2002)"},{"issue":"4","key":"31_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/nav.20216","volume":"54","author":"M. Bouhtou","year":"2007","unstructured":"Bouhtou, M., Grigoriev, A., van Hoesel, S., van der Kraaij, A.F., Spieksma, F.C., Uetz, M.: Pricing bridges to cross a river. Naval Research Logistics\u00a054(4), 411\u2013420 (2007)","journal-title":"Naval Research Logistics"},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-006-6159-x","volume":"142","author":"J.A. Audestad","year":"2006","unstructured":"Audestad, J.A., Gaivoronski, A.A., Werner, A.: Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector. Annals of Operations Research\u00a0142(1), 19\u201339 (2006)","journal-title":"Annals of Operations Research"},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.2151","volume":"29","author":"C. Pralet","year":"2007","unstructured":"Pralet, C., Verfaillie, G., Schiex, T.: An algebraic graphical model for decision with uncertainties, feasibilities, and utilities. Journal of Artificial Intelligence Research\u00a029, 421\u2013489 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"31_CR18","unstructured":"Bordeaux, L., Hamadi, Y., Quimper, C.G., Samulowitz, H.: Expressions It\u00e9r\u00e9es en Programmation par Contraintes. In: Fages, F. (ed.) Journ\u00e9es Francophones de Programmationpar Contraintes, pp. 98\u2013107 (2007)"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","first-page":"239","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H. Chen","year":"2004","unstructured":"Chen, H., P\u00e1l, M.: Optimization, games, and quantified constraint satisfaction. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 239\u2013250. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:06:03Z","timestamp":1715238363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}