↓ Skip to main content

Principles and Practice of Constraint Programming – CP 2003

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Ten Challenges Redux : Recent Progress in Propositional Reasoning and Search
  3. Altmetric Badge
    Chapter 2 Automated Mechanism Design: A New Application Area for Search Algorithms
  4. Altmetric Badge
    Chapter 3 Languages versus Packages for Constraint Problem Solving
  5. Altmetric Badge
    Chapter 4 Constraint Patterns
  6. Altmetric Badge
    Chapter 5 Control Abstractions for Local Search
  7. Altmetric Badge
    Chapter 6 Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems
  8. Altmetric Badge
    Chapter 7 Boosting Chaff’s Performance by Incorporating CSP Heuristics
  9. Altmetric Badge
    Chapter 8 Efficient CNF Encoding of Boolean Cardinality Constraints
  10. Altmetric Badge
    Chapter 9 A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows
  11. Altmetric Badge
    Chapter 10 Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
  12. Altmetric Badge
    Chapter 11 hibiscus : A Constraint Programming Application to Staff Scheduling in Health Care
  13. Altmetric Badge
    Chapter 12 Constraint-Based Optimization with the Minimax Decision Criterion
  14. Altmetric Badge
    Chapter 13 An Algebraic Approach to Multi-sorted Constraints
  15. Altmetric Badge
    Chapter 14 Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms
  16. Altmetric Badge
    Chapter 15 Box Constraint Collections for Adhoc Constraints
  17. Altmetric Badge
    Chapter 16 Propagation Redundancy in Redundant Modelling
  18. Altmetric Badge
    Chapter 17 Soft Constraints: Complexity and Multimorphisms
  19. Altmetric Badge
    Chapter 18 Constraint Satisfaction Differential Problems
  20. Altmetric Badge
    Chapter 19 A Wealth of SAT Distributions with Planted Assignments
  21. Altmetric Badge
    Chapter 20 Redundant Modeling for the QuasiGroup Completion Problem
  22. Altmetric Badge
    Chapter 21 Open Constraint Optimization
  23. Altmetric Badge
    Chapter 22 Constraints for Breaking More Row and Column Symmetries
  24. Altmetric Badge
    Chapter 23 Generic SBDD Using Computational Group Theory
  25. Altmetric Badge
    Chapter 24 Using Stochastic Local Search to Solve Quantified Boolean Formulae
  26. Altmetric Badge
    Chapter 25 Solving Max-SAT as Weighted CSP
  27. Altmetric Badge
    Chapter 26 Constraint Reasoning over Strings
  28. Altmetric Badge
    Chapter 27 Tractability by Approximating Constraint Languages
  29. Altmetric Badge
    Chapter 28 A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stable Set Problem
  30. Altmetric Badge
    Chapter 29 A Constraint-Aided Conceptual Design Environment for Autodesk Inventor
  31. Altmetric Badge
    Chapter 30 Fast Bound Consistency for the Global Cardinality Constraint
  32. Altmetric Badge
    Chapter 31 Propagating N-Ary Rigid-Body Constraints
  33. Altmetric Badge
    Chapter 32 Solving ‘Still Life’ with Soft Constraints and Bucket Elimination
  34. Altmetric Badge
    Chapter 33 Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
  35. Altmetric Badge
    Chapter 34 Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints
  36. Altmetric Badge
    Chapter 35 Discrepancy-Based Additive Bounding for the AllDifferent Constraint
  37. Altmetric Badge
    Chapter 36 A Synthesis of Constraint Satisfaction and Constraint Solving
  38. Altmetric Badge
    Chapter 37 Maintaining Longest Paths Incrementally
  39. Altmetric Badge
    Chapter 38 Resolution and Constraint Satisfaction
  40. Altmetric Badge
    Chapter 39 Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
  41. Altmetric Badge
    Chapter 40 Symmetry Breaking Using Stabilizers
  42. Altmetric Badge
    Chapter 41 An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
  43. Altmetric Badge
    Chapter 42 Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities
  44. Altmetric Badge
    Chapter 43 Using Constraint Programming to Solve the Maximum Clique Problem
  45. Altmetric Badge
    Chapter 44 Greater Efficiency for Conditional Constraint Satisfaction
  46. Altmetric Badge
    Chapter 45 Incremental Computation of Resource-Envelopes in Producer-Consumer Models
  47. Altmetric Badge
    Chapter 46 Approximated Consistency for Knapsack Constraints
  48. Altmetric Badge
    Chapter 47 Cost-Based Filtering for Shorter Path Constraints
  49. Altmetric Badge
    Chapter 48 Bounded Backtracking for the Valued Constraint Satisfaction Problems
  50. Altmetric Badge
    Chapter 49 Consistency and Propagation with Multiset Constraints: A Formal Viewpoint
  51. Altmetric Badge
    Chapter 50 Pruning while Sweeping over Task Intervals
  52. Altmetric Badge
    Chapter 51 Improving Backtrack Search for Solving the TCSP
  53. Altmetric Badge
    Chapter 52 Certainty Closure
  54. Altmetric Badge
    Chapter 53 clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming
  55. Altmetric Badge
    Chapter 54 To Be or Not to Be ... a Global Constraint
  56. Altmetric Badge
    Chapter 55 Constraint Programming for Modelling and Solving Modal Satisfiability
  57. Altmetric Badge
    Chapter 56 Distributed Forward Checking
  58. Altmetric Badge
    Chapter 57 A New Class of Binary CSPs for which Arc-Consistency Is a Decision Procedure
  59. Altmetric Badge
    Chapter 58 Semi-automatic Modeling by Constraint Acquisition
  60. Altmetric Badge
    Chapter 59 Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs
  61. Altmetric Badge
    Chapter 60 Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
  62. Altmetric Badge
    Chapter 61 Toy(FD): Sketch of Operational Semantics
  63. Altmetric Badge
    Chapter 62 Scheduling in the Face of Uncertain Resource Consumption and Utility
  64. Altmetric Badge
    Chapter 63 Supertree Construction with Constraint Programming
  65. Altmetric Badge
    Chapter 64 (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver
  66. Altmetric Badge
    Chapter 65 Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search Problems
  67. Altmetric Badge
    Chapter 66 A Canonicity Test for Configuration
  68. Altmetric Badge
    Chapter 67 Improved Algorithms for Max-restricted Path Consistency
  69. Altmetric Badge
    Chapter 68 CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
  70. Altmetric Badge
    Chapter 69 A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container
  71. Altmetric Badge
    Chapter 70 Unrestricted Nogood Recording in CSP Search
  72. Altmetric Badge
    Chapter 71 Constraints over Ontologies
  73. Altmetric Badge
    Chapter 72 Using Constraints for Exploring Catalogs
  74. Altmetric Badge
    Chapter 73 Intermediate (Learned) Consistencies
  75. Altmetric Badge
    Chapter 74 Semi-independent Partitioning: A Method for Bounding the Solution to COP’s
  76. Altmetric Badge
    Chapter 75 Boosting as a Metaphor for Algorithm Design
  77. Altmetric Badge
    Chapter 76 An Efficient Filtering Algorithm for Disjunction of Constraints
  78. Altmetric Badge
    Chapter 77 INCOP: An Open Library for INcomplete Combinatorial OPtimization
  79. Altmetric Badge
    Chapter 78 A Composition Algorithm for Very Hard Graph 3-Colorability Instances
  80. Altmetric Badge
    Chapter 79 Efficient Representation of Discrete Sets for Constraint Programming
  81. Altmetric Badge
    Chapter 80 Applying Interchangeability Techniques to the Distributed Breakout Algorithm
  82. Altmetric Badge
    Chapter 81 Symmetry Breaking in Graceful Graphs
  83. Altmetric Badge
    Chapter 82 Tree Local Search
  84. Altmetric Badge
    Chapter 83 A SAT-Based Approach to Multiple Sequence Alignment
  85. Altmetric Badge
    Chapter 84 Maintaining Dominance Consistency
  86. Altmetric Badge
    Chapter 85 Terminating Decision Algorithms Optimally
  87. Altmetric Badge
    Chapter 86 Scene Reconstruction Based on Constraints: Details on the Equation System Decomposition
  88. Altmetric Badge
    Chapter 87 A New Approach to Solving SAT-Encoded Binary CSPs
  89. Altmetric Badge
    Chapter 88 FeReRA: A Multi-agent Approach to Constraint Satisfaction
  90. Altmetric Badge
    Chapter 89 Semantic Decomposition for Solving Distance Constraints
  91. Altmetric Badge
    Chapter 90 Using Constraint Programming and Simulation for Execution Monitoring and On-Line Rescheduling with Uncertainty
  92. Altmetric Badge
    Chapter 91 On the Enhancement of the Informed Backtracking Algorithm
  93. Altmetric Badge
    Chapter 92 Extending CLP with Metaheuristics
  94. Altmetric Badge
    Chapter 93 Self Configuring Constraint Programming Systems
  95. Altmetric Badge
    Chapter 94 Interactive Tradeoff Generation
  96. Altmetric Badge
    Chapter 95 Introducing esra , a Relational Language for Modelling Combinatorial Problems (Abstract)
  97. Altmetric Badge
    Chapter 96 Abstracting Constraints Using Constraints
  98. Altmetric Badge
    Chapter 97 Sensitivity Analysis in CSPs
  99. Altmetric Badge
    Chapter 98 Solution Stability in Constraint Satisfaction Problems
  100. Altmetric Badge
    Chapter 99 distn : An Euclidean Distance Global Constraint
  101. Altmetric Badge
    Chapter 100 Algorithmic Mechanism Design and Constraints
  102. Altmetric Badge
    Chapter 101 Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary Relations
  103. Altmetric Badge
    Chapter 102 Optimising the Representation and Evaluation of Semiring Combination Constraints
  104. Altmetric Badge
    Chapter 103 Symmetry Breaking Ordering Constraints
  105. Altmetric Badge
    Chapter 104 Observation of Constraint Programs
  106. Altmetric Badge
    Chapter 105 Search Programming
  107. Altmetric Badge
    Chapter 106 Exploiting Microstructure in CSPs
  108. Altmetric Badge
    Chapter 107 Using Case-Based Reasoning to Write Constraint Programs
  109. Altmetric Badge
    Chapter 108 Reformulation Techniques for a Class of Permutation Problems
  110. Altmetric Badge
    Chapter 109 NuSBDS: An Easy to Use Symmetry Breaking System
  111. Altmetric Badge
    Chapter 110 Interactivity in Constraint Programming
  112. Altmetric Badge
    Chapter 111 Identifying Inconsistent CSPs by Relaxation
  113. Altmetric Badge
    Chapter 112 Useful Explanations
  114. Altmetric Badge
    Chapter 113 Teacher and Learner Profiles for Constraint Acquisition
  115. Altmetric Badge
    Chapter 114 Comparison of Symmetry Breaking Methods
  116. Altmetric Badge
    Chapter 115 Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
  117. Altmetric Badge
    Chapter 116 Search for Mathematical Objects
  118. Altmetric Badge
    Chapter 117 Explanations for Global Constraints
  119. Altmetric Badge
    Chapter 118 Watching Clauses in Quantified Boolean Formulae
  120. Altmetric Badge
    Chapter 119 Distributed Constraint-Based Railway Simulation
  121. Altmetric Badge
    Chapter 120 Dynamic Step Size Adjustment in Iterative Deepening Search
  122. Altmetric Badge
    Chapter 121 Learning Good Variable Orderings
  123. Altmetric Badge
    Chapter 122 An Adaptive Controller for Real-Time Resolution of the Vehicle Routing Problem
  124. Altmetric Badge
    Chapter 123 α -Dynamic Controllability of Simple Temporal Problems with Preferences and Uncertainty
  125. Altmetric Badge
    Chapter 124 Computing Explanations for Global Scheduling Constraints
  126. Altmetric Badge
    Chapter 125 Restart Strategies: Analysis and Simulation
  127. Altmetric Badge
    Chapter 126 OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
10 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 – CP 2003
Published by
Lecture notes in computer science, January 2003
DOI 10.1007/b13743
ISBNs
978-3-54-020202-8, 978-3-54-045193-8
Authors

Francesca Rossi

Editors

Rossi, Francesca

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 14 May 2021.
All research outputs
#8,882,501
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#2,580
of 8,229 outputs
Outputs of similar age
#35,117
of 140,128 outputs
Outputs of similar age from Lecture notes in computer science
#43
of 93 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
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 gotten more attention than average, scoring higher than 52% 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 140,128 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 16th percentile – i.e., 16% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 93 others from the same source and published within six weeks on either side of this one. This one is in the 34th percentile – i.e., 34% of its contemporaries scored the same or lower than it.