↓ Skip to main content

Principles and Practice of Constraint Programming

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Constraint Programming and a Usability Quest
  3. Altmetric Badge
    Chapter 2 Optimization Challenges in Smart Grid Operations
  4. Altmetric Badge
    Chapter 3 Where Are the Interesting Problems?
  5. Altmetric Badge
    Chapter 4 A Generic Method for Identifying and Exploiting Dominance Relations
  6. Altmetric Badge
    Chapter 5 Scheduling Scientific Experiments on the Rosetta/Philae Mission
  7. Altmetric Badge
    Chapter 6 Max-Sur-CSP on Two Elements
  8. Altmetric Badge
    Chapter 7 An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality
  9. Altmetric Badge
    Chapter 8 Conflict Directed Lazy Decomposition
  10. Altmetric Badge
    Chapter 9 Improving SAT-Based Weighted MaxSAT Solvers
  11. Altmetric Badge
    Chapter 10 Distributed Tree Decomposition with Privacy
  12. Altmetric Badge
    Chapter 11 Refining Restarts Strategies for SAT and UNSAT
  13. Altmetric Badge
    Chapter 12 Boosting Local Consistency Algorithms over Floating-Point Numbers
  14. Altmetric Badge
    Chapter 13 A Model Seeker: Extracting Global Constraint Models from Positive Examples
  15. Altmetric Badge
    Chapter 14 On Computing Minimal Equivalent Subformulas
  16. Altmetric Badge
    Chapter 15 Including Soft Global Constraints in DCOPs
  17. Altmetric Badge
    Chapter 16 The Weighted Average Constraint
  18. Altmetric Badge
    Chapter 17 Weibull-Based Benchmarks for Bin Packing
  19. Altmetric Badge
    Chapter 18 Space-Time Tradeoffs for the Regular Constraint
  20. Altmetric Badge
    Chapter 19 Inter-instance Nogood Learning in Constraint Programming
  21. Altmetric Badge
    Chapter 20 Solving Temporal Problems Using SMT: Strong Controllability
  22. Altmetric Badge
    Chapter 21 A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP
  23. Altmetric Badge
    Chapter 22 Optimisation Modelling for Software Developers
  24. Altmetric Badge
    Chapter 23 Adaptive Bisection of Numerical CSPs
  25. Altmetric Badge
    Chapter 24 Resource Constrained Shortest Paths with a Super Additive Objective Function
  26. Altmetric Badge
    Chapter 25 Relating Proof Complexity Measures and Practical Hardness of SAT
  27. Altmetric Badge
    Chapter 26 The SeqBin Constraint Revisited
  28. Altmetric Badge
    Chapter 27 Eigenvector Centrality in Industrial SAT Instances
  29. Altmetric Badge
    Chapter 28 Classifying and Propagating Parity Constraints
  30. Altmetric Badge
    Chapter 29 Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle
  31. Altmetric Badge
    Chapter 30 Propagating Soft Table Constraints
  32. Altmetric Badge
    Chapter 31 WCSP Integration of Soft Neighborhood Substitutability
  33. Altmetric Badge
    Chapter 32 Increasing Symmetry Breaking by Preserving Target Symmetries
  34. Altmetric Badge
    Chapter 33 A Scalable Sweep Algorithm for the cumulative Constraint
  35. Altmetric Badge
    Chapter 34 A New Encoding from MinSAT into MaxSAT
  36. Altmetric Badge
    Chapter 35 Solving Minimal Constraint Networks in Qualitative Spatial and Temporal Reasoning
  37. Altmetric Badge
    Chapter 36 Containment, Equivalence and Coreness from CSP to QCSP and Beyond
  38. Altmetric Badge
    Chapter 37 An Optimal Filtering Algorithm for Table Constraints
  39. Altmetric Badge
    Chapter 38 Parallel SAT Solver Selection and Scheduling
  40. Altmetric Badge
    Chapter 39 Constraint Satisfaction over Bit-Vectors
  41. Altmetric Badge
    Chapter 40 Towards Solver-Independent Propagators
  42. Altmetric Badge
    Chapter 41 Interactive Algorithm for Multi-Objective Constraint Optimization
  43. Altmetric Badge
    Chapter 42 Focus : A Constraint for Concentrating High Costs
  44. Altmetric Badge
    Chapter 43 Refining Abstract Interpretation Based Value Analysis with Constraint Programming Techniques
  45. Altmetric Badge
    Chapter 44 Time-Dependent Simple Temporal Networks
  46. Altmetric Badge
    Chapter 45 Improved Bounded Max-Sum for Distributed Constraint Optimization
  47. Altmetric Badge
    Chapter 46 Principles and Practice of Constraint Programming
  48. Altmetric Badge
    Chapter 47 Contributions to the Theory of Practical Quantified Boolean Formula Solving
  49. Altmetric Badge
    Chapter 48 Breaking Variable Symmetry in Almost Injective Problems
  50. Altmetric Badge
    Chapter 49 Understanding, Improving and Parallelizing MUS Finding Using Model Rotation
  51. Altmetric Badge
    Chapter 50 Revisiting Neighborhood Inverse Consistency on Binary CSPs
  52. Altmetric Badge
    Chapter 51 Syntactically Characterizing Local-to-Global Consistency in ORD-Horn
  53. Altmetric Badge
    Chapter 52 A Hybrid Paradigm for Adaptive Parallel Search
  54. Altmetric Badge
    Chapter 53 A Constraint Programming Approach for the Traveling Purchaser Problem
  55. Altmetric Badge
    Chapter 54 Constraint-Based Register Allocation and Instruction Scheduling
  56. Altmetric Badge
    Chapter 55 Maximising the Net Present Value of Large Resource-Constrained Projects
  57. Altmetric Badge
    Chapter 56 Comparing Solution Methods for the Machine Reassignment Problem
  58. Altmetric Badge
    Chapter 57 A Boolean Model for Enumerating Minimal Siphons and Traps in Petri Nets
  59. Altmetric Badge
    Chapter 58 Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem
  60. Altmetric Badge
    Chapter 59 The Offshore Resources Scheduling Problem: Detailing a Constraint Programming Approach
  61. Altmetric Badge
    Chapter 60 Computational Protein Design as a Cost Function Network Optimization Problem
  62. Altmetric Badge
    Chapter 61 A Filtering Technique for Fragment Assembly- Based Proteins Loop Modeling with Constraints
  63. Altmetric Badge
    Chapter 62 A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots
  64. Altmetric Badge
    Chapter 63 The Semigroups of Order 10
  65. Altmetric Badge
    Chapter 64 Exploring Chemistry Using SMT
  66. Altmetric Badge
    Chapter 65 A Pseudo-Boolean Set Covering Machine
  67. Altmetric Badge
    Chapter 66 Finding a Nash Equilibrium by Asynchronous Backtracking
  68. Altmetric Badge
    Chapter 67 Reasoning over Biological Networks Using Maximum Satisfiability
  69. Altmetric Badge
    Chapter 68 Principles and Practice of Constraint Programming
  70. Altmetric Badge
    Chapter 69 Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains
  71. Altmetric Badge
    Chapter 70 Constraint Programming for Path Planning with Uncertainty
  72. Altmetric Badge
    Chapter 71 Feature Term Subsumption Using Constraint Programming with Basic Variable Symmetry
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (93rd percentile)
  • High Attention Score compared to outputs of the same age and source (95th percentile)

Mentioned by

blogs
1 blog
twitter
4 X users
patent
1 patent

Citations

dimensions_citation
8 Dimensions

Readers on

mendeley
1 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.
Title
Principles and Practice of Constraint Programming
Published by
Lecture notes in computer science, January 2012
DOI 10.1007/978-3-642-33558-7
ISBNs
978-3-64-233557-0, 978-3-64-233558-7
Authors

Michela Milano

Editors

Milano, Michela

X Demographics

X Demographics

The data shown below were collected from the profiles of 4 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 17. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 03 June 2022.
All research outputs
#2,219,973
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#369
of 8,229 outputs
Outputs of similar age
#15,663
of 255,923 outputs
Outputs of similar age from Lecture notes in computer science
#20
of 487 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 91st percentile: it's in the top 10% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,229 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done particularly well, scoring higher than 95% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 255,923 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 93% of its contemporaries.
We're also able to compare this research output to 487 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 95% of its contemporaries.