↓ Skip to main content

Principles and Practice of Constraint Programming – CP 2011

Overview of attention for book
Cover of 'Principles and Practice of Constraint Programming – CP 2011'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Orchestrating Satisfiability Engines
  3. Altmetric Badge
    Chapter 2 Operations Research and Constraint Programming at Google
  4. Altmetric Badge
    Chapter 3 Solving Problems with CP: Four Common Pitfalls to Avoid
  5. Altmetric Badge
    Chapter 4 A Constraint Seeker: Finding and Ranking Global Constraints from Examples
  6. Altmetric Badge
    Chapter 5 Bin Repacking Scheduling in Virtualized Datacenters
  7. Altmetric Badge
    Chapter 6 Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming
  8. Altmetric Badge
    Chapter 7 The Design of Cryptographic S-Boxes Using CSPs
  9. Altmetric Badge
    Chapter 8 Principles and Practice of Constraint Programming – CP 2011
  10. Altmetric Badge
    Chapter 9 A Hybrid Approach for Solving Real-World Nurse Rostering Problems
  11. Altmetric Badge
    Chapter 10 Constraint Programming for Controller Synthesis
  12. Altmetric Badge
    Chapter 11 Neuron Constraints to Model Complex Real-World Problems
  13. Altmetric Badge
    Chapter 12 A Constraint Based Approach to Cyclic RCPSP
  14. Altmetric Badge
    Chapter 13 An Efficient Light Solver for Querying the Semantic Web
  15. Altmetric Badge
    Chapter 14 On Guaranteeing Polynomially Bounded Search Tree Size
  16. Altmetric Badge
    Chapter 15 A Framework for Decision-Based Consistencies
  17. Altmetric Badge
    Chapter 16 Hierarchically Nested Convex VCSP
  18. Altmetric Badge
    Chapter 17 Tractable Triangles
  19. Altmetric Badge
    Chapter 18 On Minimal Weighted Clones
  20. Altmetric Badge
    Chapter 19 Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
  21. Altmetric Badge
    Chapter 20 Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource
  22. Altmetric Badge
    Chapter 21 Synthesis of Search Algorithms from High-Level CP Models
  23. Altmetric Badge
    Chapter 22 Revisiting the tree Constraint
  24. Altmetric Badge
    Chapter 23 Half Reification and Flattening
  25. Altmetric Badge
    Chapter 24 The Parameterized Complexity of Local Consistency
  26. Altmetric Badge
    Chapter 25 Symmetry Breaking in Numeric Constraint Problems
  27. Altmetric Badge
    Chapter 26 On Minimal Constraint Networks
  28. Altmetric Badge
    Chapter 27 Structural Tractability of Constraint Optimization
  29. Altmetric Badge
    Chapter 28 Models and Strategies for Variants of the Job Shop Scheduling Problem
  30. Altmetric Badge
    Chapter 29 MaxRPC Algorithms Based on Bitwise Operations
  31. Altmetric Badge
    Chapter 30 Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
  32. Altmetric Badge
    Chapter 31 Large Neighborhood Search for Dial-a-Ride Problems
  33. Altmetric Badge
    Chapter 32 On Deciding MUS Membership with QBF
  34. Altmetric Badge
    Chapter 33 On the Relative Efficiency of DPLL and OBDDs with Axiom and Join
  35. Altmetric Badge
    Chapter 34 Min CSP on Four Elements: Moving beyond Submodularity
  36. Altmetric Badge
    Chapter 35 Algorithm Selection and Scheduling
  37. Altmetric Badge
    Chapter 36 Incorporating Variance in Impact-Based Search
  38. Altmetric Badge
    Chapter 37 A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
  39. Altmetric Badge
    Chapter 38 A CSP Solver Focusing on fac Variables
  40. Altmetric Badge
    Chapter 39 Constraint Reasoning and Kernel Clustering for Pattern Decomposition with Scaling
  41. Altmetric Badge
    Chapter 40 Solving Qualitative Constraints Involving Landmarks
  42. Altmetric Badge
    Chapter 41 Searching for Doubly Self-orthogonal Latin Squares
  43. Altmetric Badge
    Chapter 42 QCSP on Partially Reflexive Forests
  44. Altmetric Badge
    Chapter 43 The Computational Complexity of Disconnected Cut and 2 K 2 -Partition
  45. Altmetric Badge
    Chapter 44 Reducing the Search Space of Resource Constrained DCOPs
  46. Altmetric Badge
    Chapter 45 Proving Symmetries by Model Transformation
  47. Altmetric Badge
    Chapter 46 Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering
  48. Altmetric Badge
    Chapter 47 Boolean Equi-propagation for Optimized SAT Encoding
  49. Altmetric Badge
    Chapter 48 CP Models for Maximum Common Subgraph Problems
  50. Altmetric Badge
    Chapter 49 Principles and Practice of Constraint Programming – CP 2011
  51. Altmetric Badge
    Chapter 50 Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
  52. Altmetric Badge
    Chapter 51 A More Efficient BDD-Based QBF Solver
  53. Altmetric Badge
    Chapter 52 Constraint Propagation for Efficient Inference in Markov Logic
  54. Altmetric Badge
    Chapter 53 Octagonal Domains for Continuous Constraints
  55. Altmetric Badge
    Chapter 54 A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint
  56. Altmetric Badge
    Chapter 55 Automatic Generation of Constraints for Partial Symmetry Breaking
  57. Altmetric Badge
    Chapter 56 Beyond QCSP for Solving Control Problems
  58. Altmetric Badge
    Chapter 57 On Mini-Buckets and the Min-fill Elimination Ordering
  59. Altmetric Badge
    Chapter 58 Search Combinators
  60. Altmetric Badge
    Chapter 59 Variable Independence and Resolution Paths for Quantified Boolean Formulas
  61. Altmetric Badge
    Chapter 60 Pruning Rules for Constrained Optimisation for Conditional Preferences
  62. Altmetric Badge
    Chapter 61 Checking and Filtering Global Set Constraints
Attention for Chapter 35: Algorithm Selection and Scheduling
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
38 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Algorithm Selection and Scheduling
Chapter number 35
Book title
Principles and Practice of Constraint Programming – CP 2011
Published by
Springer, Berlin, Heidelberg, September 2011
DOI 10.1007/978-3-642-23786-7_35
Book ISBNs
978-3-64-223785-0, 978-3-64-223786-7
Authors

Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann

Mendeley readers

The data shown below were compiled from readership statistics for 38 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 2 5%
Unknown 36 95%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 15 39%
Student > Bachelor 5 13%
Student > Master 5 13%
Researcher 4 11%
Student > Doctoral Student 3 8%
Other 4 11%
Unknown 2 5%
Readers by discipline Count As %
Computer Science 24 63%
Engineering 7 18%
Economics, Econometrics and Finance 1 3%
Psychology 1 3%
Mathematics 1 3%
Other 0 0%
Unknown 4 11%