Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
35
views
0
references
Top references
cited by
17
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,398
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Principles and Practice of Constraint Programming – CP 2003
other
Editor(s):
Francesca Rossi
Publication date
(Print):
2003
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Author and book information
Book
ISBN (Print):
978-3-540-20202-8
ISBN (Electronic):
978-3-540-45193-8
Publication date (Print):
2003
DOI:
10.1007/b13743
SO-VID:
87a3de4e-a835-4699-812b-0e43eb3e99f4
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
pp. 19
Automated Mechanism Design: A New Application Area for Search Algorithms
pp. 37
Languages versus Packages for Constraint Problem Solving
pp. 53
Constraint Patterns
pp. 65
Control Abstractions for Local Search
pp. 81
Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems
pp. 96
Boosting Chaff’s Performance by Incorporating CSP Heuristics
pp. 123
A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows
pp. 138
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
pp. 153
hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
pp. 168
Constraint-Based Optimization with the Minimax Decision Criterion
pp. 183
An Algebraic Approach to Multi-sorted Constraints
pp. 199
Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms
pp. 214
Box Constraint Collections for Adhoc Constraints
pp. 229
Propagation Redundancy in Redundant Modelling
pp. 244
Soft Constraints: Complexity and Multimorphisms
pp. 259
Constraint Satisfaction Differential Problems
pp. 274
A Wealth of SAT Distributions with Planted Assignments
pp. 288
Redundant Modeling for the QuasiGroup Completion Problem
pp. 303
Open Constraint Optimization
pp. 318
Constraints for Breaking More Row and Column Symmetries
pp. 333
Generic SBDD Using Computational Group Theory
pp. 348
Using Stochastic Local Search to Solve Quantified Boolean Formulae
pp. 363
Solving Max-SAT as Weighted CSP
pp. 377
Constraint Reasoning over Strings
pp. 392
Tractability by Approximating Constraint Languages
pp. 407
A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stable Set Problem
pp. 422
A Constraint-Aided Conceptual Design Environment for Autodesk Inventor
pp. 437
Fast Bound Consistency for the Global Cardinality Constraint
pp. 452
Propagating N-Ary Rigid-Body Constraints
pp. 466
Solving ‘Still Life’ with Soft Constraints and Bucket Elimination
pp. 480
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
pp. 495
Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints
pp. 510
Discrepancy-Based Additive Bounding for the AllDifferent Constraint
pp. 525
A Synthesis of Constraint Satisfaction and Constraint Solving
pp. 540
Maintaining Longest Paths Incrementally
pp. 555
Resolution and Constraint Satisfaction
pp. 570
Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
pp. 585
Symmetry Breaking Using Stabilizers
pp. 600
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
pp. 615
Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities
pp. 634
Using Constraint Programming to Solve the Maximum Clique Problem
pp. 649
Greater Efficiency for Conditional Constraint Satisfaction
pp. 664
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
pp. 679
Approximated Consistency for Knapsack Constraints
pp. 694
Cost-Based Filtering for Shorter Path Constraints
pp. 709
Bounded Backtracking for the Valued Constraint Satisfaction Problems
pp. 724
Consistency and Propagation with Multiset Constraints: A Formal Viewpoint
pp. 739
Pruning while Sweeping over Task Intervals
pp. 754
Improving Backtrack Search for Solving the TCSP
pp. 769
Certainty Closure
pp. 784
clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming
pp. 789
To Be or Not to Be ... a Global Constraint
pp. 795
Constraint Programming for Modelling and Solving Modal Satisfiability
pp. 801
Distributed Forward Checking
pp. 807
A New Class of Binary CSPs for which Arc-Consistency Is a Decision Procedure
pp. 812
Semi-automatic Modeling by Constraint Acquisition
pp. 817
Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs
pp. 822
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
pp. 827
Toy(FD): Sketch of Operational Semantics
pp. 832
Scheduling in the Face of Uncertain Resource Consumption and Utility
pp. 837
Supertree Construction with Constraint Programming
pp. 842
(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver
pp. 847
Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search Problems
pp. 853
A Canonicity Test for Configuration
pp. 858
Improved Algorithms for Max-restricted Path Consistency
pp. 863
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
pp. 868
A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container
pp. 873
Unrestricted Nogood Recording in CSP Search
pp. 878
Constraints over Ontologies
pp. 883
Using Constraints for Exploring Catalogs
pp. 889
Intermediate (Learned) Consistencies
pp. 894
Semi-independent Partitioning: A Method for Bounding the Solution to COP’s
pp. 899
Boosting as a Metaphor for Algorithm Design
pp. 904
An Efficient Filtering Algorithm for Disjunction of Constraints
pp. 909
INCOP: An Open Library for INcomplete Combinatorial OPtimization
pp. 914
A Composition Algorithm for Very Hard Graph 3-Colorability Instances
pp. 920
Efficient Representation of Discrete Sets for Constraint Programming
pp. 925
Applying Interchangeability Techniques to the Distributed Breakout Algorithm
pp. 930
Symmetry Breaking in Graceful Graphs
pp. 935
Tree Local Search
pp. 940
A SAT-Based Approach to Multiple Sequence Alignment
pp. 945
Maintaining Dominance Consistency
pp. 950
Terminating Decision Algorithms Optimally
pp. 956
Scene Reconstruction Based on Constraints: Details on the Equation System Decomposition
pp. 962
A New Approach to Solving SAT-Encoded Binary CSPs
pp. 963
FeReRA: A Multi-agent Approach to Constraint Satisfaction
pp. 964
Semantic Decomposition for Solving Distance Constraints
pp. 966
Using Constraint Programming and Simulation for Execution Monitoring and On-Line Rescheduling with Uncertainty
pp. 967
On the Enhancement of the Informed Backtracking Algorithm
pp. 968
Extending CLP with Metaheuristics
pp. 969
Self Configuring Constraint Programming Systems
pp. 970
Interactive Tradeoff Generation
pp. 971
Introducing esra, a Relational Language for Modelling Combinatorial Problems (Abstract)
pp. 972
Abstracting Constraints Using Constraints
pp. 973
Sensitivity Analysis in CSPs
pp. 974
Solution Stability in Constraint Satisfaction Problems
pp. 975
distn: An Euclidean Distance Global Constraint
pp. 976
Algorithmic Mechanism Design and Constraints
pp. 977
Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary Relations
pp. 978
Optimising the Representation and Evaluation of Semiring Combination Constraints
pp. 979
Symmetry Breaking Ordering Constraints
pp. 980
Observation of Constraint Programs
pp. 981
Search Programming
pp. 982
Exploiting Microstructure in CSPs
pp. 983
Using Case-Based Reasoning to Write Constraint Programs
pp. 984
Reformulation Techniques for a Class of Permutation Problems
pp. 985
NuSBDS: An Easy to Use Symmetry Breaking System
pp. 986
Interactivity in Constraint Programming
pp. 987
Identifying Inconsistent CSPs by Relaxation
pp. 988
Useful Explanations
pp. 989
Teacher and Learner Profiles for Constraint Acquisition
pp. 990
Comparison of Symmetry Breaking Methods
pp. 991
Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
pp. 992
Search for Mathematical Objects
pp. 993
Explanations for Global Constraints
pp. 994
Watching Clauses in Quantified Boolean Formulae
pp. 995
Distributed Constraint-Based Railway Simulation
pp. 996
Dynamic Step Size Adjustment in Iterative Deepening Search
pp. 997
Learning Good Variable Orderings
pp. 998
An Adaptive Controller for Real-Time Resolution of the Vehicle Routing Problem
pp. 999
α-Dynamic Controllability of Simple Temporal Problems with Preferences and Uncertainty
pp. 1000
Computing Explanations for Global Scheduling Constraints
pp. 1001
Restart Strategies: Analysis and Simulation
pp. 1002
OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine
Similar content
3,398
Synthesis of Ultrahigh Molecular Weight Polymers with Low PDIs by Polymerizations of 1-Decene, 1-Dodecene, and 1-Tetradecene by Cp*TiMe 2 (O-2,6- i Pr 2 C 6 H 3 )–Borate Catalyst
Authors:
Kotohiro Nomura
,
Sarntamon Pengoubol
,
Wannida Apisuk
Identification of key functionalization species in the Cp*Ir(III)-catalyzed-ortho halogenation of benzamides.
Authors:
Alexis J Guzmán Santiago
,
Caleb A Brown
,
Roger D Sommer
…
Measurement of the charm mixing parameter \(y_{CP} - y_{CP}^{K\pi}\) using two-body \(D^0\) meson decays
Authors:
LHCb collaboration
,
R. Aaij
,
A. Abdelmotteleb
…
See all similar
Cited by
17
Direct Trajectory Optimization and Costate Estimation via an Orthogonal Collocation Method
Authors:
Tom Thorvaldsen
,
Anil V. Rao
,
Geoffrey Huntington
…
Convergence of the forward-backward sweep method in optimal control
Authors:
Michael McAsey
,
Libin Mou
,
Weimin Han
Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method
Authors:
Anil V. Rao
,
Michael Patterson
,
Camila Francolin
…
See all cited by