{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:37:30Z","timestamp":1760708250731,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_6","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"80-95","source":"Crossref","is-referenced-by-count":12,"title":["Cost Evaluation of Soft Global Constraints"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"6_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Mathl. Comput. Modelling"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"23","author":"R.K. Ahuja","year":"1994","unstructured":"Ahuja, R.K., Orlin, J.B., Stein, C., Tarjan, R.E.: Improved algorithms for bipartite network flow. SIAM Journal on Computing\u00a023(5), 906\u2013933 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR3","unstructured":"Bajard, J.-C., Common, H., Kenion, C., Krob, D., Muller, J.-M., Petit, A., Robert, Y., Morvan, M.: Exercices d\u2019algorithmique: oraux d\u2019ENS. In: International Thomson Publishing, pp. 72\u201374 (1997) (in French)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-49481-2_8","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Baptiste","year":"1998","unstructured":"Baptiste, P., Le Pape, C., Peridy, L.: Global constraints for partial CSPs: A case-study of resource and due date constraints. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 87\u2013102. Springer, Heidelberg (1998)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45349-0_6","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Beldiceanu","year":"2000","unstructured":"Beldiceanu, N.: Global constraints as graph properties on a structured network of elementary constraints of the same type. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 52\u201366. Springer, Heidelberg (2000)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45578-7_15","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 211\u2013224. Springer, Heidelberg (2001)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-45635-X_12","volume-title":"Logic Programming","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing the cardinality-path constraint family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 59\u201373. Springer, Heidelberg (2001)"},{"issue":"12","key":"6_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"6_CR9","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1970","unstructured":"Berge, C.: Graphs and hypergraphs. Dunod, Paris (1970)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-45193-8_54","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C. Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., Van Hentenryck, P.: To be or not to be.. a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 789\u2013794. Springer, Heidelberg (2003)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1026441215081","volume":"4","author":"S. Bistarelli","year":"1999","unstructured":"Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., Fargier, H.: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints\u00a04, 199\u2013240 (1999)","journal-title":"Constraints"},{"key":"6_CR12","unstructured":"Dechter, R.: Constraint networks. Encyclopedia of Artificial Intelligence, 276\u2013285 (1992)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1987","unstructured":"Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence\u00a034, 1\u201338 (1987)","journal-title":"Artificial Intelligence"},{"key":"6_CR14","volume-title":"Flows in networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Flukerson, D.: Flows in networks. Princeton University Press, Princeton (1962)"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inform. Processing Letters\u00a012(3), 133\u2013137 (1981)","journal-title":"Inform. Processing Letters"},{"key":"6_CR16","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.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979) ISBN 0-7167-1045-5"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0004-3702(00)00051-5","volume":"123","author":"I. Gent","year":"2000","unstructured":"Gent, I., Stergiou, K., Walsh, T.: Decomposable constraints. Artificial Intelligence\u00a0123, 133\u2013156 (2000)","journal-title":"Artificial Intelligence"},{"key":"6_CR18","volume-title":"Combinatorial optimization: Networks and matroids","author":"E. Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston (1976)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-540-48085-3_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Pachet","year":"1999","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 331\u2013345. Springer, Heidelberg (1999)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Petit, T., R\u00e9gin, J.-C., Bessi\u00e8re, C.: Meta constraints on violations for over constrained problems. In: Proceedings IEEE-ICTAI, pp. 358\u2013365 (2000)","DOI":"10.1109\/TAI.2000.889894"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45578-7_31","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Petit","year":"2001","unstructured":"Petit, T., R\u00e9gin, J.-C., Bessi\u00e8re, C.: Specific filtering algorithms for over constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 451\u2013463. Springer, Heidelberg (2001)"},{"key":"6_CR22","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings AAAI, pp. 362\u2013367 (1994)"},{"key":"6_CR23","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings AAAI, pp. 209\u2013215 (1996)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-45193-8_5","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"P. Van Hentenryck","year":"2003","unstructured":"Van Hentenryck, P., Michel, L.: Control abstractions for local search. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 66\u201380. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T04:19:47Z","timestamp":1740629987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}