Cost evaluation of soft global constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3011, Issue , 2004, Pages 80-95

  Beldiceanu, Nicolas ^a   Petit, Thierry ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION;

COST EVALUATIONS; GLOBAL CONSTRAINTS; GRAPH PROPERTIES; NP-HARD; OBJECT BASED; POLYNOMIAL COMPLEXITY;

COSTS;

EID: 35048892497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_6     Document Type: Review

References (24)

1. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57-73, 1993.
2. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan. Improved algorithms for bipartite network flow. SIAM Journal on Computing, 23:5:906-933, 1994.
3. J-C. Bajard, H. Common, C. Kenion, D. Krob, J-M. Muller, A. Petit, Y. Robert, and M. Morvan. Exercices d'algorithmique : oraux d'ENS. International Thomson Publishing, in French, pages 72-74, 1997.
4. P. Baptiste, C. Le Pape, and L. Peridy. Global constraints for partial CSPs: A case-study of resource and due date constraints. Proceedings CP, pages 87-102, 1998.
5. N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. Proceedings CP, pages 52-66, 2000.
6. N. Beldiceanu. Pruning for the minimum constraint family and for the number of distinct values constraint family. Proceedings CP, pages 211-224, 2001.
7. N. Beldiceanu and M. Carlsson. Revisiting the cardinality operator and introducing the cardinality-path constraint family. Proceedings ICLP, 2237:59-73, 2001.
8. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling, 20(12):97-123, 1994.
9. C. Berge. Graphs and hypergraphs. Dunod, Paris, 1970.
10. C. Bessière and P. Van Hentenryck. To be or not to be... a global constraint. Proceedings CP, pages 789-794, 2003.
11. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints, 4:199-240, 1999.
12. R. Dechter. Constraint networks. Encyclopedia of Artificial Intelligence, pages 276-285, 1992.
13. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1-38, 1987.
14. L. Ford and D. Flukerson. Flows in networks. Princeton University Press, 1962.
15. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are np-complete. Inform. Processing Letters, 12(3):133-137, 1981.
16. M. R. Garey and D. S. Johnson. Computers and intractability : A guide to the theory of NP-completeness. W. H. Freeman and Company, ISBN 0-7167-1045-5, 1979.
17. I. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence, 123:133-156, 2000.
18. E. Lawler. Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston, 1976.
19. F. Pachet and P. Roy. Automatic generation of music programs. Proceedings CP, pages 331-345, 1999.
20. T. Petit, J-C. Régin, and C. Bessière. Meta constraints on violations for over constrained problems. Proceedings IEEE-ICTAI, pages 358-365, 2000.
21. T. Petit, J-C. Régin, and C. Bessière. Specific filtering algorithms for over constrained problems. Proceedings CP, pages 451-463, 2001.
22. J-C. Régin. A filtering algorithm for constraints of difference in CSPs. Proceedings AAAI, pages 362-367, 1994.
23. J-C. Régin. Generalized arc consistency for global cardinality constraint. Proceedings AAAI, pages 209-215, 1996.
24. P. Van Hentenryck and L. Michel. Control abstractions for local search. Proceedings CP, pages 66-80, 2003.