All Stories

  1. Explanation-based large neighborhood search
  2. Propagation engine prototyping with a domain specific language
  3. An Optimal Constraint Programming Approach to the Open-Shop Problem
  4. Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems
  5. Integrating Strong Local Consistencies into Constraint Solvers
  6. Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource
  7. Solving a real-time allocation problem with constraint programming
  8. Trends in Constraint Programming
  9. Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming
  10. Editorial
  11. Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
  12. Constraint Solving in Uncertain and Dynamic Environments: A Survey
  13. Integrating Benders Decomposition Within Constraint Programming
  14. Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
  15. Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming
  16. Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
  17. Foreword
  18. Decomposition and Learning for a Hard Real Time Task Allocation Problem
  19. Loading aircraft for military operations
  20. Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools
  21. Local search with constraint propagation and conflict-based heuristics
  22. Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems
  23. Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
  24. The Path repair algorithm
  25. Maintaining Arc-Consistency within Dynamic Backtracking
  26. Implementing constraint relaxation over finite domains using assumption-based truth maintenance systems
  27. Building University timetables using constraint logic programming
  28. Le système expert « Nereis » des annélides polychètes de France (ordre des Phyllodocida, Amphinomida, Spintherida et Eunicida)
  29. Reactive Approaches
  30. The Past, Present and Future of Constraint Programming
  31. Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem
  32. No Java without caffeine: A tool for dynamic analysis of Java programs
  33. Instantiating and detecting design patterns: putting bits and pieces together