Principles and Practice of Constraint Programming - CP 2002

8th International Conference, CP 2002 Ithaca, NY, USA, September 9–13, 2002 Proceedings

Editors:

ISBN: 978-3-540-44120-5 (Print) 978-3-540-46135-7 (Online)

Table of contents (83 chapters)

previous Page of 5
  1. Technical Papers

    1. No Access

      Book Chapter

      Pages 1-16

      Reduced Cost-Based Ranking for Generating Promising Subproblems

    2. No Access

      Book Chapter

      Pages 17-32

      Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem

    3. No Access

      Book Chapter

      Pages 33-46

      On Optimal Correction of Inconsistent Linear Constraints

    4. No Access

      Book Chapter

      Pages 47-62

      Temporal Planning through Mixed Integer Programming: A Preliminary Report

    5. No Access

      Book Chapter

      Pages 63-79

      A New Multi-resource cumulatives Constraint with Negative Heights

    6. No Access

      Book Chapter

      Pages 80-92

      On the Sum Constraint: Relaxation and Applications

    7. No Access

      Book Chapter

      Pages 93-108

      Global Constraints for Lexicographic Orderings

    8. No Access

      Book Chapter

      Pages 109-123

      A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations

    9. No Access

      Book Chapter

      Pages 124-138

      Amplification of Search Performance through Randomization of Heuristics

    10. No Access

      Book Chapter

      Pages 139-154

      Computing the Envelope for Stepwise-Constant Resource Allocations

    11. No Access

      Book Chapter

      Pages 155-171

      Local Probing Applied to Scheduling

    12. No Access

      Book Chapter

      Pages 172-184

      A Hybrid Approach for SAT

    13. No Access

      Book Chapter

      Pages 185-199

      Recovering and Exploiting Structural Knowledge from CNF Formulas

    14. No Access

      Book Chapter

      Pages 200-215

      Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation

    15. No Access

      Book Chapter

      Pages 216-232

      Accelerating Random Walks

    16. No Access

      Book Chapter

      Pages 233-248

      Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT

    17. No Access

      Book Chapter

      Pages 249-264

      Learning and Solving Soft Temporal Constraints: An Experimental Study

    18. No Access

      Book Chapter

      Pages 264-279

      Opportunistic Specialization in Russian Doll Search

    19. No Access

      Book Chapter

      Pages 280-294

      Range-Based Algorithm for Max-CSP

    20. No Access

      Book Chapter

      Pages 295-310

      Resolution Complexity of Random Constraints

previous Page of 5