Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings

Editors:

ISBN: 978-3-642-38170-6 (Print) 978-3-642-38171-3 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-11

    Stronger Inference through Implied Literals from Conflicts and Knapsack Covers

  3. No Access

    Book Chapter

    Pages 12-27

    Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling

  4. No Access

    Book Chapter

    Pages 28-43

    Cloud Branching

  5. No Access

    Book Chapter

    Pages 44-60

    Modeling Robustness in CSPs as Weighted CSPs

  6. No Access

    Book Chapter

    Pages 61-76

    Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms

  7. No Access

    Book Chapter

    Pages 77-93

    Revisiting Hyper Binary Resolution

  8. No Access

    Book Chapter

    Pages 94-110

    Decision Diagrams and Dynamic Programming

  9. No Access

    Book Chapter

    Pages 111-127

    CP Methods for Scheduling and Routing with Time-Dependent Task Costs

  10. No Access

    Book Chapter

    Pages 128-143

    An MDD Approach to Multidimensional Bin Packing

  11. No Access

    Book Chapter

    Pages 144-159

    A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint

  12. No Access

    Book Chapter

    Pages 160-175

    Enumerating Infeasibility: Finding Multiple MUSes Quickly

  13. No Access

    Book Chapter

    Pages 176-192

    Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem

  14. No Access

    Book Chapter

    Pages 193-203

    Improved Discrete Reformulations for the Quadratic Assignment Problem

  15. No Access

    Book Chapter

    Pages 204-215

    Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods

  16. No Access

    Book Chapter

    Pages 216-233

    On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables

  17. No Access

    Book Chapter

    Pages 234-250

    Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint

  18. No Access

    Book Chapter

    Pages 251-267

    A Lagrangian Relaxation for Golomb Rulers

  19. No Access

    Book Chapter

    Pages 268-283

    MiniZinc with Functions

  20. No Access

    Book Chapter

    Pages 284-299

    Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming

  21. No Access

    Book Chapter

    Pages 300-315

    The Rooted Maximum Node-Weight Connected Subgraph Problem

previous Page of 2