{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:36Z","timestamp":1725680376406},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_9","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"129-145","source":"Crossref","is-referenced-by-count":0,"title":["Flow-Based Combinatorial Chance Constraints"],"prefix":"10.1007","author":[{"given":"Andre A.","family":"Cire","sequence":"first","affiliation":[]},{"given":"Elvin","family":"Coban","sequence":"additional","affiliation":[]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall (1993)","key":"9_CR1"},{"doi-asserted-by":"crossref","unstructured":"Altarelli, F., Braunstein, A., Ramezanpour, A., Zecchina, R.: Stochastic Matching Problem. Physical Review Letters\u00a0106(190601) (2011)","key":"9_CR2","DOI":"10.1103\/PhysRevLett.106.190601"},{"doi-asserted-by":"crossref","unstructured":"Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., Rudra, A.: When lp is the cure for your matching woes: Improved bounds for stochastic matchings. In: Proceedings of the 18th Annual European Symposium on Algorithms, pp. 218\u2013230. Springer (2010)","key":"9_CR3","DOI":"10.1007\/978-3-642-15781-3_19"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-24664-0_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Katriel, I., Thiel, S.: Filtering Algorithms for the Same Constraint. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 65\u201379. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Brown, K.N., Miguel, I.: Uncertainty and Change. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 21. Elsevier (2006)","key":"9_CR5","DOI":"10.1016\/S1574-6526(06)80025-8"},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Daskalakis, C., Kleinberg, R.D., Lin, H.: Online bipartite perfect matching with augmentations. In: INFOCOM, pp. 1044\u20131052 (2009)","key":"9_CR6","DOI":"10.1109\/INFCOM.2009.5062016"},{"doi-asserted-by":"crossref","unstructured":"Chen, N., Immorlica, N., Karlin, A., Mahdian, M., Rudra, A.: Approximating matches made in heaven. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp. 266\u2013278 (2009)","key":"9_CR7","DOI":"10.1007\/978-3-642-02927-1_23"},{"issue":"7","key":"9_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1287\/mnsc.18.7.349","volume":"18","author":"C. Derman","year":"1972","unstructured":"Derman, C., Lieberman, G.J., Ross, S.M.: A Sequential Stochastic Assignment Problem. Management Science\u00a018(7), 349\u2013355 (1972)","journal-title":"Management Science"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2009.12.004","volume":"205","author":"B. Escoffier","year":"2010","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J., Spanjaard, O.: Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. European Journal of Operational Research\u00a0205(1), 19\u201330 (2010)","journal-title":"European Journal of Operational Research"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0028188","volume-title":"Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"H. Fargier","year":"1993","unstructured":"Fargier, H., Lang, J.: Uncertainty in Constraint Satisfaction Problems: A Probabilistic Approach. In: Moral, S., Kruse, R., Clarke, E. (eds.) ECSQARU 1993. LNCS, vol.\u00a0747, pp. 97\u2013104. Springer, Heidelberg (1993)"},{"unstructured":"Fargier, H., Lang, J., Martin-Clouaire, R., Schiex, T.: A constraint satisfaction framework for decision under uncertainty. In: Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, pp. 167\u2013174. Morgan Kaufmann (1995)","key":"9_CR11"},{"doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V.S., Muthukrishnan, S.: Online Stochastic Matching: Beating 1-1\/e. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117\u2013126. IEEE Computer Society (2009)","key":"9_CR12","DOI":"10.1109\/FOCS.2009.72"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co. (1979)","key":"9_CR13"},{"unstructured":"Hauskrecht, M., Upfal, E.: A clustering approach to solving large stochastic matching problems. In: Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, pp. 219\u2013226 (2001)","key":"9_CR14"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-04244-7_36","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"B. Hnich","year":"2009","unstructured":"Hnich, B., Rossi, R., Tarim, S.A., Prestwich, S.: Synthesizing Filtering Algorithms for Global Chance-Constraints. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 439\u2013453. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, pp. 587\u2013596. ACM (2011)","key":"9_CR16","DOI":"10.1145\/1993636.1993715"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-73420-8_17","volume-title":"Automata, Languages and Programming","author":"I. Katriel","year":"2007","unstructured":"Katriel, I., Kenyon-Mathieu, C., Upfal, E.: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 171\u2013182. Springer, Heidelberg (2007)"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.ejor.2004.10.011","volume":"172","author":"N. Kong","year":"2006","unstructured":"Kong, N., Schaefer, A.J.: A factor 1\/2 approximation algorithm for two-stage stochastic matching problems. European Journal of Operational Research\u00a0172(3), 740\u2013746 (2006)","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"crossref","unstructured":"Louveaux, F.V., Schultz, R.: Stochastic Integer Programming. In: Ruszczynski, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, vol.\u00a010. Elsevier (2003)","key":"9_CR19","DOI":"10.1016\/S0927-0507(03)10004-7"},{"unstructured":"Majercik, S.M.: Stochastic Boolean Satisfiability. In: Biere, A., Heule, M., van Maaren, M., Walsh, T. (eds.) Handbook of Satisfiability, pp. 887\u2013925. IOS Press (2009)","key":"9_CR20"},{"unstructured":"R\u00e9gin, J.-C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, vol.\u00a01, pp. 362\u2013367. AAAI Press (1994)","key":"9_CR21"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1020506526052","volume":"7","author":"J.C. R\u00e9gin","year":"2002","unstructured":"R\u00e9gin, J.C.: Cost-Based Arc Consistency for Global Cardinality Constraints. Constraints\u00a07, 387\u2013405 (2002)","journal-title":"Constraints"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s10601-007-9038-4","volume":"13","author":"R. Rossi","year":"2008","unstructured":"Rossi, R., Tarim, S.A., Hnich, B., Prestwich, S.D.: A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints. Constraints\u00a013(4), 490\u2013517 (2008)","journal-title":"Constraints"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-85958-1_16","volume-title":"Principles and Practice of Constraint Programming","author":"R. Rossi","year":"2008","unstructured":"Rossi, R., Tarim, S.A., Hnich, B., Prestwich, S.D.: Cost-Based Domain Filtering for Stochastic Constraint Programming. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 235\u2013250. Springer, Heidelberg (2008)"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"S.A. Tarim","year":"2006","unstructured":"Tarim, S.A., Manandhar, S., Walsh, T.: Stochastic Constraint Programming: A Scenario-Based Approach. Constraints\u00a011(1), 53\u201380 (2006)","journal-title":"Constraints"},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10601-007-9039-3","volume":"14","author":"S.A. Tarim","year":"2009","unstructured":"Tarim, S.A., Hnich, B., Rossi, R., Prestwich, S.D.: Cost-Based Filtering Techniques for Stochastic Inventory Control Under Service Level Constraints. Constraints\u00a014(2), 137\u2013176 (2009)","journal-title":"Constraints"},{"key":"9_CR27","first-page":"123","volume":"32","author":"D. Terekhov","year":"2008","unstructured":"Terekhov, D., Beck, J.C.: A constraint programming approach for solving a queueing control problem. J. Artif. Int. Res.\u00a032, 123\u2013167 (2008)","journal-title":"J. Artif. Int. Res."},{"issue":"4","key":"9_CR28","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1287\/ijoc.1080.0307","volume":"21","author":"D. Terekhov","year":"2009","unstructured":"Terekhov, D., Beck, J.C., Brown, K.N.: A Constraint Programming Approach for Solving a Queueing Design and Control Problem. INFORMS Journal on Computing\u00a021(4), 549\u2013561 (2009)","journal-title":"INFORMS Journal on Computing"},{"unstructured":"Walsh, T.: Stochastic Constraint Programming. In: Proceedings of the 15th Eureopean Conference on Artificial Intelligence, pp. 111\u2013115. IOS Press (2002)","key":"9_CR29"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T01:33:22Z","timestamp":1548552802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}