On the public citation graph

Principles and Practice of Constraint Programming – CP’99

https://doi.org/10.1007/b72297
0 signed · 126 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11493853_12openalex-snapshot
Constraint Programming Based Column Generation for Employee Timetabling
inferred← citeshttps://doi.org/10.1007/11493853_16openalex-snapshot
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/11493853_17openalex-snapshot
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation
inferred← citeshttps://doi.org/10.1007/11493853_18openalex-snapshot
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price
inferred← citeshttps://doi.org/10.1007/11506676_9openalex-snapshot
Specialization of Concurrent Guarded Multi-set Transformation Rules
inferred← citeshttps://doi.org/10.1007/11527862_17openalex-snapshot
Compositional Derivation of Symmetries for Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11538363_17openalex-snapshot
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11549468_82openalex-snapshot
An Investigation of Sharing Strategies for Answer Set Solvers and SAT Solvers
inferred← citeshttps://doi.org/10.1007/11551263_6openalex-snapshot
Dependency Calculus: Reasoning in a General Point Relation Algebra
inferred← citeshttps://doi.org/10.1007/11556114_13openalex-snapshot
Casl Specifications of Qualitative Calculi
inferred← citeshttps://doi.org/10.1007/11556114_17openalex-snapshot
Categorical Methods in Qualitative Reasoning: The Case for Weak Representations
inferred← citeshttps://doi.org/10.1007/11559306_8openalex-snapshot
Hybrid CSP Solving
inferred← citeshttps://doi.org/10.1007/11564751_20openalex-snapshot
Assumption-Based Pruning in Conditional CSP
inferred← citeshttps://doi.org/10.1007/11564751_22openalex-snapshot
Symmetry and Consistency
inferred← citeshttps://doi.org/10.1007/11564751_33openalex-snapshot
Parallel Local Search in Comet
inferred← citeshttps://doi.org/10.1007/11564751_46openalex-snapshot
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/11564751_72openalex-snapshot
Approximated Consistency for the Automatic Recording Problem
inferred← citeshttps://doi.org/10.1007/11591191_5openalex-snapshot
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
inferred← citeshttps://doi.org/10.1007/11604686_26openalex-snapshot
Locally Consistent Constraint Satisfaction Problems with Binary Constraints
inferred← citeshttps://doi.org/10.1007/11757375_23openalex-snapshot
Improved Algorithm for the Soft Global Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/11757375_4openalex-snapshot
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
inferred← citeshttps://doi.org/10.1007/11757375_7openalex-snapshot
The Range Constraint: Algorithms and Implementation
inferred← citeshttps://doi.org/10.1007/11780342_36openalex-snapshot
Towards a Trichotomy for Quantified H-Coloring
inferred← citeshttps://doi.org/10.1007/11924661_2openalex-snapshot
Principal Type Inference for GHC-Style Multi-parameter Type Classes
inferred← citeshttps://doi.org/10.1007/3-540-44654-0_3openalex-snapshot
Constraint (Logic) Programming: A Survey on Research and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_4openalex-snapshot
Collaborative Learning for Constraint Solving
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_79openalex-snapshot
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45612-0_1openalex-snapshot
Meta-heuristics: The State of the Art
inferred← citeshttps://doi.org/10.1007/978-1-4471-0119-2_24openalex-snapshot
A Non-binary Constraint Satisfaction Solver: the One-Face Hyperpolyhedron Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-319-04132-2_11openalex-snapshot
Exploring the Use of GPUs in Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_17openalex-snapshot
Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_21openalex-snapshot
Subexponential Time Complexity of CSP with Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_25openalex-snapshot
Constraint-Based Lagrangian Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_29openalex-snapshot
The StockingCost Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_32openalex-snapshot
CIP and MIQP Models for the Load Balancing Nurse-to-Patient Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_35openalex-snapshot
An Increasing-Nogoods Global Constraint for Symmetry Breaking During Search
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_5openalex-snapshot
A Constraint-Based Approach to Structure Prediction for Simplified Protein Models That Outperforms Other Existing Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-24634-3_23openalex-snapshot
A Component-Based Parallel Constraint Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_15openalex-snapshot
Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_2openalex-snapshot
SIMPL: A System for Integrating Optimization Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_29openalex-snapshot
Building Models through Formal Specification
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_6openalex-snapshot
Cost Evaluation of Soft Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_7openalex-snapshot
SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24674-9_37openalex-snapshot
Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-540-24734-0_15openalex-snapshot
Solving Sports Scheduling and Timetabling Problems with Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_9openalex-snapshot
A SAT-Based Hybrid Solver for Optimal Control of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_15openalex-snapshot
Herbrand Constraints in HAL
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_21openalex-snapshot
On Hybridization of Local Search and Constraint Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_9openalex-snapshot
Constraint Handling Rules and Tabled Execution
inferred← citeshttps://doi.org/10.1007/978-3-540-28633-2_19openalex-snapshot
Applying An Improved Heuristic Based Optimiser to Solve a Set of Challenging University Timetabling Problems: An Experience Report
inferred← citeshttps://doi.org/10.1007/978-3-540-31845-3_19openalex-snapshot
Implementing Semiring-Based Constraints Using Mozart
inferred← citeshttps://doi.org/10.1007/978-3-540-31845-3_26openalex-snapshot
An Interactive Tool for the Controlled Execution of an Automated Timetabling Constraint Engine
inferred← citeshttps://doi.org/10.1007/978-3-540-39592-8_18openalex-snapshot
An Automated School Timetabling System Using Hybrid Intelligent Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-45091-7_16openalex-snapshot
Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_13openalex-snapshot
An Algebraic Approach to Multi-sorted Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_23openalex-snapshot
Generic SBDD Using Computational Group Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_35openalex-snapshot
Discrepancy-Based Additive Bounding for the AllDifferent Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_40openalex-snapshot
Symmetry Breaking Using Stabilizers
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_44openalex-snapshot
Greater Efficiency for Conditional Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_46openalex-snapshot
Approximated Consistency for Knapsack Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_57openalex-snapshot
A New Class of Binary CSPs for which Arc-Consistency Is a Decision Procedure
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_2openalex-snapshot
Non-binary Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_10openalex-snapshot
Cost Propagation – Numerical Propagation for Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_18openalex-snapshot
From High-Level Model to Branch-and-Price Solution in G12
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_4openalex-snapshot
Constraint Integer Programming: A New Approach to Integrate CP and MIP
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_17openalex-snapshot
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_26openalex-snapshot
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_11openalex-snapshot
Cost-Based Filtering for Stochastic Inventory Control
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_37openalex-snapshot
Parallelizing Constraint Programs Transparently
inferred← citeshttps://doi.org/10.1007/978-3-540-78769-3_8openalex-snapshot
Generation of Rule-Based Constraint Solvers: Combined Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_17openalex-snapshot
Dichotomic Search Protocols for Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_41openalex-snapshot
Recent Hybrid Techniques for the Multi-Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_47openalex-snapshot
Semi-automatic Generation of CHR Solvers for Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_9openalex-snapshot
Generalizing Global Constraints Based on Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-92243-8_8openalex-snapshot
Guard Reasoning in the Refined Operational Semantics of CHR
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_5openalex-snapshot
Dualities for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_6openalex-snapshot
A Logical Approach to Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_8openalex-snapshot
k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_20openalex-snapshot
Confidence-Based Work Stealing in Parallel Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_54openalex-snapshot
Maintaining State in Propagation Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_56openalex-snapshot
Weakly Monotonic Propagators
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_60openalex-snapshot
Realtime Online Solving of Quantified CSPs
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_5openalex-snapshot
The Increasing Nvalue Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_9openalex-snapshot
Hybrid Methods for the Multileaf Collimator Sequencing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_4openalex-snapshot
Tree Dualities for Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_20openalex-snapshot
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_40openalex-snapshot
Exponential Propagation for Set Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-19486-3_6openalex-snapshot
Integrating Strong Local Consistencies into Constraint Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-20364-0_9openalex-snapshot
Experiments in Parallel Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_26openalex-snapshot
On the CSP Dichotomy Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_21openalex-snapshot
Synthesis of Search Algorithms from High-Level CP Models
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_3openalex-snapshot
Solving Problems with CP: Four Common Pitfalls to Avoid
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_48openalex-snapshot
CP Models for Maximum Common Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_55openalex-snapshot
Automatic Generation of Constraints for Partial Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-3-642-29350-4_78openalex-snapshot
Improving PAWS by the Island Confinement Method
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_10openalex-snapshot
Explaining Flow-Based Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-30448-4_2openalex-snapshot
Constraint Propagation as the Core of Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_53openalex-snapshot
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_19openalex-snapshot
Dominance Driven Search
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_28openalex-snapshot
Explaining Propagators for Edge-Valued Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_36openalex-snapshot
Bandit-Based Search for Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_5openalex-snapshot
The Objective-CP Optimization System
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_6openalex-snapshot
Parallel Discrepancy-Based Search
inferred← citeshttps://doi.org/10.1007/978-3-642-45284-0_17openalex-snapshot
Parallel Performance of Declarative Programming Using a PGAS Model
inferred← citeshttps://doi.org/10.1007/s00500-019-04023-1openalex-snapshot
Integer cat swarm optimization algorithm for multiobjective integer problems
inferred← citeshttps://doi.org/10.1007/s10601-009-9085-0openalex-snapshot
Dantzig-Wolfe decomposition and branch-and-price solving in G12
inferred← citeshttps://doi.org/10.1007/s10601-011-9106-7openalex-snapshot
Data transfer planning with tree placement for collaborative environments
inferred← citeshttps://doi.org/10.1007/s13675-014-0026-3openalex-snapshot
A constraint programming primer
inferred← citeshttps://doi.org/10.1016/b978-155860890-0/50017-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.artint.2003.06.004openalex-snapshot
Cyclic consistency: A local reduction operation for binary valued constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2014.03.005openalex-snapshot
Computational protein design as an optimization problem
inferred← citeshttps://doi.org/10.1016/j.artint.2016.06.005openalex-snapshot
Tractability-preserving transformations of global cost functions
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103751openalex-snapshot
Conjure: Automatic Generation of Constraint Models from Problem Specifications
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.10.003openalex-snapshot
An integer programming approach to optimal basic block instruction scheduling for single-issue processors
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.10.043openalex-snapshot
Automatically improving the anytime behaviour of optimisation algorithms
inferred← citeshttps://doi.org/10.1016/j.engappai.2011.11.010openalex-snapshot
Scheduler-oriented algorithms to improve human–machine cooperation in transportation scheduling support systems
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00435-1openalex-snapshot
A multi-start local search algorithm for the vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12010-6openalex-snapshot
Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80019-2openalex-snapshot
Operations Research Methods in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03004-0openalex-snapshot
Chapter 4 Constraint Programming
inferred← citeshttps://doi.org/10.1017/s147106841000030xopenalex-snapshot
A complete and terminating execution model for Constraint Handling Rules
inferred← citeshttps://doi.org/10.1023/a:1020564731987openalex-snapshot
Guest Editorial
inferred← citeshttps://doi.org/10.1145/3207677.3277959openalex-snapshot
Local Search in Solution of Constraint Satisfaction Problems Represented by Non-Numerical Matrices
inferred← citeshttps://doi.org/10.3726/978-3-653-03200-0openalex-snapshot
Application Coordination in Pervasive Systems
inferred← citeshttps://doi.org/10.3726/978-3-653-03200-0/12openalex-snapshot
6. Application Coordination in Pervasive Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1909.13430openalex-snapshot
CSPLib: Twenty Years On
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.