Approximations and randomization to boost CSP techniques

Annals of Operations Research

Volumn 130, Issue 1-4, 2004, Pages 117-141

  Gomes, Carla P ^a   Shmoys, David B ^b  

^a School of Operations Research and Information Engineering   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3142670519     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000032572.32788.da     Document Type: Article

References (49)

1. Achlioptas, D., C. Gomes, H. Kautz, and B. Selman. (2000). "Generating Satisfiable Instances." In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), pp. 256-261. New Providence, RI: AAAI Press.
2. Baptista, L., I. Lynce, and J. Marques-Silva. (2001). "Complete Restart Strategies for Satisfiability." In Proceedings of the Workshop on Stochastic Search Algorithms, Seventeenth International Joint Conference on Artificial Intelligence (IJCAI01), Seattle, WA.
3. Bockmayr, A. and T. Kasper. (1998). "Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming." INFORMS Journal on Computing 10, 287-300.
4. Brelaz, D. (1979). "New Methods to Color the Vertices of a Graph." Communications of the ACM 22(4), 251-256.
5. Caseau, Y. and F. Laburthe. (1995). "Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation." In Proceedings of the 8th Franco-Japanese and 8th Franco-Chinese Conference on Combinatorics and Computer Science, Brest, France, Lecture Notes in Computer Science, Vol. 1120. New York: Springer.
6. Chen, H., C. Gomes, and B. Selman. (2001). "Formal Models of Heavy-Tailed Behavior in Combinatorial Search." In Proceedings of 7th International Conference on the Principles and Practice of Constraint Programming (CP-2001), Paphos, Cyprus, Lecture Notes in Computer Science, Vol. 2239, pp. 408-422. New York: Springer.
7. Chudak, F. and D. Shmoys. (1999). "Improved Approximation Algorithms for the Uncapacitated Facility Location Problem." Submitted for publication. Preliminary version of this paper (with the same title) appeared in Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization, 1999.
8. Colbourn, C. (1984). "The Complexity of Completing Partial Latin Squares." Discrete Applied Mathematics 8, 25-30.
9. Darby-Dowman, K., J. Little, G. Mitra, and M. Zaffalon. (1997). "Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem." Constraints 1(3), 245-264.
10. Focacci, F., A. Lodi, and M. Milano. (1999a). "Cost-Based Domain Filtering." In Proceedings of 5th International Conference on the Principles and Practice of Constraint Programming (CP-1999), Alexandria, VA, Lecture Notes in Computer Science, Vol. 1713, pp. 189-203. New York: Springer.
11. Focacci, F., A. Lodi, and M. Milano. (1999b). "Solving Tsp with Time Windows with Constraints." In Proceedings of the 16th Conference on Logic Programming, (ICLP 99), Las Cruces, NM, pp. 515-529.
12. Focacci, F., A. Lodi, and M. Milano. (2000). "Cutting Planes in Constraint Programming: An Hybrid Approach." In Proceedings of 6th International Conference on the Principles and Practice of Constraint Programming (CP-2000), Singapore, Lecture Notes in Computer Science, Vol. 1894, pp. 187-201. New York: Springer.
13. Goemans, M. and D.P. Willianson. (1994). "0.878-Approximation Algorithms for Max-Cut and Max-Sat." In Proceedings of the 26th Annual ACM-SIAM Symposium on Theory of Computing, San Diego, CA, pp. 422-431.
14. Gomes, C. (ed.). (2000-2001). The Knowledge Engineering Review 15(1) and 16(1), Special Issue on the Integration of Artificial Intelligence and Operations Research Techniques.
15. Gomes, C., R. Regis, and D. Shmoys. (2003). "An Improved Approximation Algorithm for the Partial Latin Square Extension Problem." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, MD, pp. 832-833.
16. Gomes, C. and B. Selman. (1997). "Problem Structure in the Presence of Perturbations." In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), New Providence, RI, pp. 221-227. AAAI Press.
17. Gomes, C., B. Selman, and N. Crato. (1997). "Heavy-Tailed Distributions in Combinatorial Search." In Proceedings of 6th International Conference on the Principles and Practice of Constraint Programming (CP-1997), Linz, Austria, Lecture Notes in Computer Science, Vol. 1330, pp. 121-135. New York: Springer.
18. Gomes, C., B. Selman, N. Crato, and H. Kautz. (2000). "Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems." Journal of Automated Reasoning 24(1-2), 67-100.
19. Grotschel, M., L. Lovász, and A. Schrijver. (1993). Geometric Algorithms and Combinatorial Optimization. New York: Springer.
20. Guéret, C. and N. Jussien. (1999). "Combining AI/OR Techniques for Solving Open Shop Problems." In Conference on Integration of Operations Research and Artificial Intelligence techniques in Constraint Programming (CP-AI-OR), Ferrara, Italy.
21. Heipcke, S. (1998). "Integrating Constraint Programming Techniques into Mathematical Programming." In Proceedings of 13th European Conference on Artificial Intelligence, Brigthon, UK, pp. 259-260. New York: Wiley.
22. Hill, B. (1975). "A Simple General Approach to Inference About the Tail of a Distribution." Annals of Statistics 3, 1163-1174.
23. Hogg, T. and B.C.W. Huberman (eds.). (1996). Artificial Intelligence 81(1-2), Special Issue on Phase Transitions and Complexity.
24. Hooker, J. (1996). "Resolution and the Integrality of Satisfiability Problems." Mathematical Programming 74, 1-10.
25. Hooker, J., G. Ottosson, E. Thorsteinsson, and H.-J. Kim. (1999). "On Integrating Constraint Propagation and Linear Programmimg for Combinatorial Optimization." In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), Orlando, FL, pp. 136-141. AAAI Press.
26. Ilog. (2001a). Ilog cplex 7.1. User's Manual.
27. Ilog. (2001b). Ilog Solver 5.1. User's Manual.
28. Jacobson, M. and P. Matthews. (1996). "Generating Uniformly Distributed Random Latin Squares." Journal of Combinatorial Designs 4(6), 405-437.
29. Kamath, A., N. Karmarkar, K. Ramakrishnan, and M. Resende. (1992). "A Continuous Approach to Inductive Inference." Mathematical Programming 57, 215-238.
30. Kautz, H., E. Horvitz, Y. Ruan, C. Gomes, and B. Selman. (2002). "Dynamic Restart Policies." In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), Edmonton, Canada, pp. 674-671. AAAI Press.
31. Kirkpatrick, S. and B. Selman. (1994). "Critical Behavior in the Satisfiability of Random Boolean Expressions." Science 264, 1297-1301.
32. Kumar, S., A. Russell, and R. Sundaram. (1997). "Faster Algorithms for Optimal Switch Configuration." In IEEE International Conference on Communications.
33. Kumar, S., A. Russell, and R. Sundaram. (1999). "Approximating Latin Square Extensions." Algorithmica 24, 128-138.
34. Lawler, E. and J. Labetoulle. (1978). "On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming." Journal of the Association for Computing Machinery 25, 612-619.
35. Laywine, C. and G. Mullen. (1998). Discrete Mathematics Using Latin Squares, Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley.
36. Little, J. and K. Darby-Dowman. (1995). "The Significance of Constraint Logic Programming to Operational Research." Operational Research Society, Invited Tutorial Papers.
37. Moskewicz, M., C. Madigan, Y. Zhao, L. Zhang, and S. Malik. (2001). "Chaff: Engineering and Efficient Sat Solver." In Proceedings of the 38th Design Automation Conference (DAC 2000), Las Vegas, NV, pp. 530-535.
38. Motwani, R., J. Naor, and P. Raghavan. (1997). "Randomized Approximation Algorithms in Combinatorial Optimization." In D.S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS Publishing Company.
39. Plotkin, S., D. Shmoys, and E. Tardos. (1995). "Approximation Algorithms for Fractional Packing and Covering Problems." Mathematics Operations Research 20, 257-301.
40. Refalo, P. (1999). "Tight Cooperation and Its Application in Piecewise Linear Optimization." In Proceedings of 5th International Conference on the Principles and Practice of Constraint Programming (CP-1999), Alexandria, VA, Lecture Notes in Computer Science, Vol. 1713, pp. 375-389. New York: Springer.
41. Refalo, P. (2000). "Linear Formulation of Constraint Programming Models and Hybrid Solvers." In Proceedings of 6th International Conference on the Principles and Practice of Constraint Programming (CP-2000), Singapore, Lecture Notes in Computer Science, Vol. 1894, pp. 369-383. New York: Springer.
42. Regin, J.-C. (1994). "A Filtering Algorithm for Constraints of Difference in CSP." In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Seattle, WA, pp. 362-367. AAAI Press.
43. Rodosek, R., M. Wallace, and M. Hajian. (1999). "A New Approach to Integrating Mixed Integer Programming with Constraint Logic Programming." Annals of Operations Research 86, 63-87.
44. Ruan, Y., E. Horvitz, and H. Kautz. (2002). "Restart Policies with Dependence Among Runs: A Dynamic Programming Approach." In Proceedings of 8th International Conference on the Principles and Practice of Constraint Programming (CP-2002), Ithaca, NY, Lecture Notes in Computer Science, Vol. 2470, pp. 573-586. New York: Springer.
45. Shaw, P., K. Stergiou, and T. Walsh. (1998). "Arc Consistency and Quasigroup Completion." In Proceedings of Workshop on Binary Constraints, 13th European Conference on Artificial Intelligence, Brigthon, UK. New York: Wiley.
46. Slaney, J., M. Fujita, and M. Stickel. (1995). "Automated Reasoning and Exhaustive Search: Quasigroup Existence Problems." Computers and Mathematics with Applications 29, 115-132.
47. von Neumann, J. (1953). "A Certain Zero-Sum Two-Person Game Equivalent to the Optimal Assignment Problem." In Contributions to the Theory of Games, Vol. 2. Princeton: Princeton Univ. Press.
48. Walsh, T. (1999). "Search in a Small World." In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI99), Stockholm, Sweden, pp. 1172-1177.
49. Warners, J. (1999). "Nonlinear Approaches to Satisfiability Problems." Ph.D. thesis, Technische Universiteit Eindhoven.