乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T09:11:46Z","timestamp":1689066706085},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T00:00:00Z","timestamp":1395273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10601-014-9159-5","type":"journal-article","created":{"date-parts":[[2014,3,19]],"date-time":"2014-03-19T03:08:17Z","timestamp":1395198497000},"page":"270-308","source":"Crossref","is-referenced-by-count":3,"title":["Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction"],"prefix":"10.1007","volume":"19","author":[{"given":"J. H. M.","family":"Lee","sequence":"first","affiliation":[]},{"given":"K. L.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Y. W.","family":"Shum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,20]]},"reference":[{"issue":"7","key":"9159_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"issue":"2","key":"9159_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1051\/ro\/2013032","volume":"47","author":"M Akplogan","year":"2013","unstructured":"Akplogan, M., de Givry, S., M\u00e9tivier, J.-P., Quesnel, G., Joannon, A., Garcia, F. (2013). Solving the crop allocation problem using hard and soft constraints. RAIRO - Operations Research, 47(2), 151\u2013172.","journal-title":"RAIRO - Operations Research"},{"key":"9159_CR3","unstructured":"Allouche, D., Bessi\u00e8re, C., Boizumault, P., de Givry, S., Gutierrez, P., Loudni, S., M\u00e9tivier, J.-P., Schiex, T. (2012). Filtering decomposable global cost functions. In Proceedings of AAAI\u201912, (pp. 407\u2013413)."},{"key":"9159_CR4","doi-asserted-by":"crossref","unstructured":"Allouche, D., Traor\u00e9, S., Andr\u00e9, I., de Givry, S., Katsirelos, G., Barbe, S., Schiex, T. (2012). Computational protein design as a cost function network optimization problem. In Proceedings of CP\u201912, (pp. 840\u2013849).","DOI":"10.1007\/978-3-642-33558-7_60"},{"key":"9159_CR5","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X. (2005). Global constraint catalog. Technical Report T2005- 08, Swedish Institute of Computer Science. http:\/\/www.emn.fr\/x-info\/sdemasse\/gccat\/ ."},{"issue":"12","key":"9159_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12), 97\u2013123.","journal-title":"Mathematical and Computer Modelling"},{"key":"9159_CR7","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Katriel, I., Thiel, S. (2004). Filtering algorithms for the same constraints. In Proceedings of CPAIOR\u201904, (pp. 65\u201379).","DOI":"10.1007\/978-3-540-24664-0_5"},{"key":"9159_CR8","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., & Hentenryck, P.V. (2003). To be or not to be \u2026 a global constraint. In Proceedings of CP\u201903, (pp. 789\u2013794).","DOI":"10.1007\/978-3-540-45193-8_54"},{"key":"9159_CR9","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., Katsirelos, G., Narodytska, N., Quimper, C.-G., Walsh, T. (2010). Propagating conjunctions of ALLDIFFERENT constraints. In Proceedings of AAAI\u201910, (pp. 27\u201332).","DOI":"10.1609\/aaai.v24i1.7554"},{"key":"9159_CR10","unstructured":"Bessi\u00e8re, C., & R\u00e9gin, J.-C. (1997). Arc consistency for general constraint networks: preliminary results. In Proceedings of IJCAI\u201997, (pp. 398\u2013404)."},{"issue":"1","key":"9159_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B Cabon","year":"1999","unstructured":"Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P. (1999). Radio link frequency assignment. Constraints, 4(1), 79\u201389.","journal-title":"Constraints"},{"issue":"3","key":"9159_CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10601-005-2240-3","volume":"10","author":"MC Cooper","year":"2005","unstructured":"Cooper, M.C. (2005). High-order consistency in valued constraint satisfaction. Constraints, 10(3), 283\u2013305.","journal-title":"Constraints"},{"key":"9159_CR13","unstructured":"Cooper, M.C., de Givry, S., S\u00e0nchez, M., Schiex, T., Zytnicki, M. (2008). Virtual arc consistency for weighted CSP. In Proceedings of AAAI\u201908, (pp. 253\u2013258)."},{"issue":"7\u20138","key":"9159_CR14","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"MC Cooper","year":"2010","unstructured":"Cooper, M.C., de Givry, S., S\u00e0nchez, M., Schiex, T., Zytnicki, M., Werner, T. (2010). Soft arc consistency revisited. Artificial Intelligence, 174(7\u20138), 449\u2013478.","journal-title":"Artificial Intelligence"},{"key":"9159_CR15","unstructured":"Cooper, M.C., de Givry, S., Schiex, T. (2007). Optimal soft arc consistency. In Proceedings of IJCAI\u201907, (pp. 68\u201373)."},{"issue":"1","key":"9159_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/AIC-2010-0473","volume":"24","author":"MC Cooper","year":"2011","unstructured":"Cooper, M.C., de Roquemaurel, M., R\u00e9gnier, P. (2011). A weighted CSP approach to cost-optimal planning. AI Communications, 24(1), 1\u201329.","journal-title":"AI Communications"},{"key":"9159_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.artint.2003.09.002","volume":"154","author":"MC Cooper","year":"2004","unstructured":"Cooper, M.C., & Schiex, T. (2004). Arc consistency for soft constraints. Artifical Intelligence, 154, 199\u2013227.","journal-title":"Artifical Intelligence"},{"key":"9159_CR18","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B. (1963). Linear programming and extensions. Princeton University Press.","DOI":"10.1515\/9781400884179"},{"key":"9159_CR19","unstructured":"de Givry, S., Heras, F., Zytnicki, M., Larrosa, J. (2005). Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In Proceedings of IJCAI\u201905, (pp. 84\u201389)."},{"key":"9159_CR20","unstructured":"Hooker, J.N. (2007). Integrated methods for optimization. Springer."},{"issue":"3","key":"9159_CR21","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10601-005-2237-y","volume":"10","author":"I Katriel","year":"2005","unstructured":"Katriel, I., & Thiel, S. (2005). Complete bound consistency for the global cardinality constraint. Constraints, 10(3), 115\u2013135.","journal-title":"Constraints"},{"key":"9159_CR22","unstructured":"Koster, A.M. (1999). Frequency assignment: models and algorithms. PhD thesis, University of Maastricht."},{"key":"9159_CR23","unstructured":"Larrosa, J. (2002). Node and arc consistency in weighted CSP. In Proceedings of AAAI\u201902, (pp. 48\u201353)."},{"key":"9159_CR24","unstructured":"Larrosa, J. (2003). In the quest of the best form of local consistency for weighted CSP. In Proceedings of IJCAI\u201903, (pp. 239\u2013244)."},{"issue":"1\u20132","key":"9159_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J Larrosa","year":"2004","unstructured":"Larrosa, J., & Schiex, T. (2004). Solving weighted CSP by maintaining arc consistency. Artificial Intelligence, 159(1\u20132), 1\u201326.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9159_CR26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J-L Lauriere","year":"1978","unstructured":"Lauriere, J.-L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10(1), 29\u2013127.","journal-title":"Artificial Intelligence"},{"key":"9159_CR27","unstructured":"Lee, J.H.M., & Leung, K.L. (2009). Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction. In Proceedings of IJCAI\u201909, (pp. 559\u2013565)."},{"key":"9159_CR28","doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., & Leung, K.L. (2010). A stronger consistency for soft global constraints in weighted constraint satisfaction. In Proceedings of AAAI\u201910, (pp. 121\u2013127).","DOI":"10.1609\/aaai.v24i1.7550"},{"key":"9159_CR29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1613\/jair.3476","volume":"43","author":"JHM Lee","year":"2012","unstructured":"Lee, J.H.M., & Leung, K.L. (2012). Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction. Journal of Artificial Intelligence Research, 43, 257\u2013292.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9159_CR30","unstructured":"Lee, J.H.M., Leung, K.L., Wu, Y. (2012). Polynomially decomposable global cost functions in weighted constraint satisfaction. In Proceedings of AAAI\u201912, (pp. 507\u2013513)."},{"key":"9159_CR31","doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., Leung, K.L., Shum, Y.W. (2012). Propagating polynomially (integral) linear projection-safe global cost functions in WCSPs. In Proceedings of ICTAI\u201912, (pp. 9\u201316).","DOI":"10.1109\/ICTAI.2012.11"},{"key":"9159_CR32","doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., & Shum, Y.W. (2011). Modeling soft global constraints as linear programs in weighted constraint satisfaction. In Proceedings of ICTAI\u201911, (pp. 305\u2013312).","DOI":"10.1109\/ICTAI.2011.53"},{"key":"9159_CR33","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Kan, A.R., Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"9159_CR34","doi-asserted-by":"crossref","unstructured":"Maher, M.J., Narodytska, N., Quimper, C.-G., Walsh, T. (2008). Flow-based propagators for the SEQUENCE and related global constraints. In Proceedings of CP\u201908, (pp. 159\u2013174).","DOI":"10.1007\/978-3-540-85958-1_11"},{"key":"9159_CR35","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity. Prentice-Hall."},{"key":"9159_CR36","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Mateo: Morgan Kaufmann."},{"key":"9159_CR37","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Proceedings of CP\u201904, (pp. 482\u2013495).","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9159_CR38","doi-asserted-by":"crossref","unstructured":"Petit, T., R\u00e9gin, J.-C., Bessi\u00e8re, C. (2001). Specific filtering algorithm for over-constrained problems. In Proceedings of CP\u201901, (pp. 451\u2013463).","DOI":"10.1007\/3-540-45578-7_31"},{"key":"9159_CR39","doi-asserted-by":"crossref","unstructured":"Quimper, C.-G., L\u00f3pez-Ortiz, A., Beek, P.V., Golynski, A. (2004). Improved algorithms for the global cardinality constraint. In Proceedings of CP\u201904, (pp. 542\u2013556).","DOI":"10.1007\/978-3-540-30201-8_40"},{"key":"9159_CR40","unstructured":"R\u00e9gin, J.-C. (1996). Generalized arc consistency for global cardinality constraints. In Proceedings of AAAI\u201996, (pp. 209\u2013215)."},{"key":"9159_CR41","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C. (2005). Combination of among and cardinality constraints. In Proceedings of CPAIOR\u201905, (pp. 288\u2013303).","DOI":"10.1007\/11493853_22"},{"key":"9159_CR42","unstructured":"Rossi, F., van Beek, P., Walsh, T. (2006). Handbook of constraint programming. Elsevier."},{"issue":"1\u20132","key":"9159_CR43","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s10601-007-9029-5","volume":"13","author":"M S\u00e0nchez","year":"2008","unstructured":"S\u00e0nchez, M., de Givry, S., Schiex, T. (2008). Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints, 13(1\u20132), 130\u2013154.","journal-title":"Constraints"},{"key":"9159_CR44","unstructured":"Sandholm, T. (1999). An algorithm for optimal winner determination in combinatorial auctions. In Proceedings of IJCAI\u201999, (pp. 542\u2013547)."},{"key":"9159_CR45","unstructured":"Schiex, T., Fargier, H., Verfaillie, G. (1995). Valued constraint satisfaction problems: hard and easy problems. In Proceedings of IJCAI\u201995, (pp. 631\u2013639)."},{"issue":"3","key":"9159_CR46","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V., Nguyen, A., Artigues, C. (2008). The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADDEF\u20192005 challenge problem. European Journal of Operational Research, 191(3), 912\u2013927.","journal-title":"European Journal of Operational Research"},{"issue":"4\u20135","key":"9159_CR47","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10732-006-6550-4","volume":"12","author":"W-J van Hoeve","year":"2006","unstructured":"van Hoeve, W.-J., Pesant, G., Rousseau, L.-M. (2006). On global warming: flow-based soft global constraints. Journal of Heuristics, 12(4\u20135), 347\u2013373.","journal-title":"Journal of Heuristics"},{"key":"9159_CR48","unstructured":"Wolsey, L. (1998). Integer programming. Wiley."},{"key":"9159_CR49","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1613\/jair.2797","volume":"35","author":"M Zytnicki","year":"2009","unstructured":"Zytnicki, M., Gaspin, C., Schiex, T. (2009). Bounds arc consistency for weighted CSPs. Journal of Artificial Intelligence Research, 35, 593\u2013621.","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9159-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-014-9159-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9159-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T08:56:06Z","timestamp":1689065766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-014-9159-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,20]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9159"],"URL":"https:\/\/doi.org\/10.1007\/s10601-014-9159-5","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,20]]}}}