The cardinality matrix constraint

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

Volumn 3258, Issue , 2004, Pages 572-587

  Régin, Jean Charles ^a   Gomes, Carla P ^b  

^a IBM   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCHEDULING;

COMBINATORIAL STRUCTURES; GLOBAL CARDINALITY CONSTRAINT; HARD COMPUTATIONAL PROBLEM; INTRINSIC STRUCTURES; NETWORK FLOW PROBLEMS; REAL-WORLD PROBLEM; STANDARD CONSTRAINTS; TRANSPORTATION PROBLEM;

PROBLEM SOLVING;

EID: 26444611756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_42     Document Type: Article

References (16)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, 1993.
2. C. Berge. Graphe et Hypergraphes. Dunod, Paris, 1970.
3. M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In ECAI'88, proceedings of the European Conference on Artificial Intelligence, pages 290-295, 1988.
4. I. Dotu, A. del Val, and M. Cebrian. Redundant modeling for the quasigroup completion problem. In Proceedings of CP'03, pages 288-302, 2003.
5. K. Easton, G. Nemhauser, and M. Trick. Sports scheduling. In J. Leung, editor, Handbook of Scheduling: Models, Algorithms and Performance Analysis. CRC Press, 2004.
6. L. Ford and D. Fulkerson. Flows in Networks. Princeton University Press, 1962.
7. D. Gale. A theorem on flows in networks. Pacific J. Math, 7:1073-1082, 1957.
8. C. Gomes and J.-C. Regin. The alldiff matrix. Technical report, Intelligent Information Institute - Cornell University, 2003.
9. I. Katriel and S. Thiel. Fast bound consistency for the global cardinality constraint. In Proceedings CP'03, pages 437-451, Kinsale, Ireland, 2003.
10. W. Kocjan and P. Kreuger. Filtering methods for symmetric cardinality constraints In First International Conference, CPAIOR 2004, pages 200-208, Nice, France, 2004.
11. M. Milano (ed.). Constraint and Integer Programming: Toward a Unified Methodology. Kluwer, 2003.
12. J.-C. Régin. Generalized arc consistency for global cardinality constraint. In Proceedings AAAI-96, pages 209-215, Portland, Oregon, 1996.
13. H. Ryser. A combinatorial theorem with application to latin rectangles. Proc. Amec. Math. Soc., 2:550-552, 1951.
14. H. Ryser. Combinatorial properties of matrices of zeros and ones. Canad. J. Math, 9:371-377, 1957.
15. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1:146-160, 1972.
16. R. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, 1983.