Impact-based search strategies for constraint programming

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

Volumn 3258, Issue , 2004, Pages 557-571

  Refalo, Philippe ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; NUMBER THEORY;

COMPLETION PROBLEM; CONSTRAINT PROGRAMMING; IMPROVE PERFORMANCE; KEY FEATURE; LATIN SQUARE; MAGIC SQUARE; SEARCH SPACES; SEARCH STRATEGIES;

INTEGER PROGRAMMING;

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

References (15)

1. ILOG CPLEX 9.0. User Manual. ILOG, S.A., Gentilly, France, September 2003.
2. M. Benichou, J.M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, and O. Vincent. Experiments in mixed-integer linear programming. Mathematical Programming, (1):76-94, 1971.
3. C. Bessiere, A. Chmeiss, and L. Sais. Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In Proceedings of CP 2001, pages 565-569, 2001.
4. C. Bessière and J-C. Régin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In CP96, Second International Conference on Principles and Practice of Constraint Programming, pages 61-75, Cambridge, MA, USA, 1996.
5. R.E. Bixby, W. Cook, A. Cox, and E.K. Lee. Parallel mixed integer programming. Technical Report Research Monograph CRPC-TR95554, Center for Research on Parallel Computation, 1995.
6. D. Brélaz. New methods to color the vertices of a graph. Communication of the ACM, (22):251-256, 1979.
7. J.-M. Gauthier and G. Ribiere. Experiments in mixed-integer linear programming using pseudo-costs. Mathematical Programming, (12):26-47, 1977.
8. C. Gomes. Complete randomized backtrack search (survey). In M. Milano, editor, Constraint and Integer Programming: Toward a Unified Methodology, pages 233-283. Kluwer, 2003.
9. C. Gomes and J.-C. Regin. Modelling alldi. matrix models in constraint programming. In Optimization days, Montreal, Canada, 2003.
10. C. Gomes and D. Shmoys. Completing quasigroups or latin squares: A structured graph coloring problem. In Proceedings of the Computational Symposium on Graph Coloring and Extensions, 2002.
11. R. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, (14):263-313, 1980.
12. J. Linderoth and M. Savelsberg. A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing, 11(2):173-187, 1999.
13. J.J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Science, 19:229-250, 1979.
14. M.W. Moskewicz, C.F. Madigan, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference, 2001.
15. B. Smith. The Brelaz heuristic and optimal static ordering. In Proceedings of CP'99, pages 405-418, (Alexandria, VA), 1999.