↓ Skip to main content

Principles and Practice of Constraint Programming - CP 2009

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Constraint-Based Schedulers, Do They Really Work?
  3. Altmetric Badge
    Chapter 2 Challenges for Constraint Reasoning and Optimization in Computational Sustainability
  4. Altmetric Badge
    Chapter 3 Observations on Symmetry Breaking
  5. Altmetric Badge
    Chapter 4 Generating Optimal Stowage Plans for Container Vessel Bays
  6. Altmetric Badge
    Chapter 5 Real-Time Tabu Search for Video Tracking Association
  7. Altmetric Badge
    Chapter 6 Pin Assignment Using Stochastic Local Search Constraint Programming
  8. Altmetric Badge
    Chapter 7 Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
  9. Altmetric Badge
    Chapter 8 Scheduling the CB1000 Nanoproteomic Analysis System with Python, Tailor, and Minion
  10. Altmetric Badge
    Chapter 9 Solving Nurse Rostering Problems Using Soft Global Constraints
  11. Altmetric Badge
    Chapter 10 Online Selection of Quorum Systems for RAMBO Reconfiguration
  12. Altmetric Badge
    Chapter 11 A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem
  13. Altmetric Badge
    Chapter 12 Memoisation for Constraint-Based Local Search
  14. Altmetric Badge
    Chapter 13 On the Structure of Industrial SAT Instances
  15. Altmetric Badge
    Chapter 14 A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms
  16. Altmetric Badge
    Chapter 15 Filtering Numerical CSPs Using Well-Constrained Subsystems
  17. Altmetric Badge
    Chapter 16 Minimising Decision Tree Size as Combinatorial Optimisation
  18. Altmetric Badge
    Chapter 17 Hull Consistency under Monotonicity
  19. Altmetric Badge
    Chapter 18 A Constraint on the Number of Distinct Vectors with Application to Localization
  20. Altmetric Badge
    Chapter 19 Approximating Weighted Max-SAT Problems by Compensating for Relaxations
  21. Altmetric Badge
    Chapter 20 Confidence-Based Work Stealing in Parallel Constraint Programming
  22. Altmetric Badge
    Chapter 21 Minimizing the Maximum Number of Open Stacks by Customer Search
  23. Altmetric Badge
    Chapter 22 Using Relaxations in Maximum Density Still Life
  24. Altmetric Badge
    Chapter 23 Constraint-Based Graph Matching
  25. Altmetric Badge
    Chapter 24 Constraint Representations and Structural Tractability
  26. Altmetric Badge
    Chapter 25 Asynchronous Inter-Level Forward-Checking for DisCSPs
  27. Altmetric Badge
    Chapter 26 From Model-Checking to Temporal Logic Constraint Solving
  28. Altmetric Badge
    Chapter 27 Exploiting Problem Structure for Solution Counting
  29. Altmetric Badge
    Chapter 28 Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition
  30. Altmetric Badge
    Chapter 29 Lazy Clause Generation Reengineered
  31. Altmetric Badge
    Chapter 30 The Proper Treatment of Undefinedness in Constraint Languages
  32. Altmetric Badge
    Chapter 31 Search Spaces for Min-Perturbation Repair
  33. Altmetric Badge
    Chapter 32 Snake Lex: An Alternative to Double Lex
  34. Altmetric Badge
    Chapter 33 Closing the Open Shop: Contradicting Conventional Wisdom
  35. Altmetric Badge
    Chapter 34 Reasoning about Optimal Collections of Solutions
  36. Altmetric Badge
    Chapter 35 Constraints of Difference and Equality: A Complete Taxonomic Characterisation
  37. Altmetric Badge
    Chapter 36 Synthesizing Filtering Algorithms for Global Chance-Constraints
  38. Altmetric Badge
    Chapter 37 An Interpolation Method for CLP Traversal
  39. Altmetric Badge
    Chapter 38 Same-Relation Constraints
  40. Altmetric Badge
    Chapter 39 Dialectic Search
  41. Altmetric Badge
    Chapter 40 Restricted Global Grammar Constraints
  42. Altmetric Badge
    Chapter 41 Principles and Practice of Constraint Programming - CP 2009
  43. Altmetric Badge
    Chapter 42 Propagator Groups
  44. Altmetric Badge
    Chapter 43 Efficient Generic Search Heuristics within the EMBP Framework
  45. Altmetric Badge
    Chapter 44 Failed Value Consistencies for Constraint Satisfaction
  46. Altmetric Badge
    Chapter 45 A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations
  47. Altmetric Badge
    Chapter 46 SOGgy Constraints: Soft Open Global Constraints
  48. Altmetric Badge
    Chapter 47 Exploiting Problem Decomposition in Multi-objective Constraint Optimization
  49. Altmetric Badge
    Chapter 48 Search Space Extraction
  50. Altmetric Badge
    Chapter 49 Principles and Practice of Constraint Programming - CP 2009
  51. Altmetric Badge
    Chapter 50 Compiling All Possible Conflicts of a CSP
  52. Altmetric Badge
    Chapter 51 On the Power of Clause-Learning SAT Solvers with Restarts
  53. Altmetric Badge
    Chapter 52 Slice Encoding for Constraint-Based Planning
  54. Altmetric Badge
    Chapter 53 Principles and Practice of Constraint Programming - CP 2009
  55. Altmetric Badge
    Chapter 54 Maintaining State in Propagation Solvers
  56. Altmetric Badge
    Chapter 55 Cost-Driven Interactive CSP with Constraint Relaxation
  57. Altmetric Badge
    Chapter 56 Weakly Monotonic Propagators
  58. Altmetric Badge
    Chapter 57 Constraint-Based Optimal Testing Using DNNF Graphs
  59. Altmetric Badge
    Chapter 58 Why Cumulative Decomposition Is Not as Bad as It Sounds
  60. Altmetric Badge
    Chapter 59 On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
  61. Altmetric Badge
    Chapter 60 Realtime Online Solving of Quantified CSPs
  62. Altmetric Badge
    Chapter 61 Constraint-Based Local Search for the Automatic Generation of Architectural Tests
  63. Altmetric Badge
    Chapter 62 Edge Finding Filtering Algorithm for Discrete Cumulative Resources in ${\mathcal O}(kn {\rm log} n)$
  64. Altmetric Badge
    Chapter 63 Evaluation of Length-Lex Set Variables
  65. Altmetric Badge
    Chapter 64 The Complexity of Valued Constraint Models
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

Citations

dimensions_citation
8 Dimensions

Readers on

mendeley
17 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 2009
Published by
Lecture notes in computer science, January 2009
DOI 10.1007/978-3-642-04244-7
ISBNs
978-3-64-204243-0, 978-3-64-204244-7
Authors

Ian P. Gent

Editors

Gent, Ian P.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Italy 1 6%
Unknown 16 94%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 29%
Researcher 3 18%
Student > Master 2 12%
Professor 1 6%
Other 1 6%
Other 2 12%
Unknown 3 18%
Readers by discipline Count As %
Computer Science 10 59%
Arts and Humanities 1 6%
Business, Management and Accounting 1 6%
Mathematics 1 6%
Economics, Econometrics and Finance 1 6%
Other 1 6%
Unknown 2 12%
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 10 August 2022.
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
#54,543
of 189,349 outputs
Outputs of similar age from Lecture notes in computer science
#59
of 176 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 189,349 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 17th percentile – i.e., 17% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 176 others from the same source and published within six weeks on either side of this one. This one is in the 48th percentile – i.e., 48% of its contemporaries scored the same or lower than it.