On the public citation graph
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
0 signed · 348 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-46135-3_60openalex-snapshot
Distributed Constraint-Based Railway Simulation
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_102openalex-snapshot
Optimising the Representation and Evaluation of Semiring Combination Constraints
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_11openalex-snapshot
hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_120openalex-snapshot
Dynamic Step Size Adjustment in Iterative Deepening Search
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_13openalex-snapshot
An Algebraic Approach to Multi-sorted Constraints
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_14openalex-snapshot
Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_27openalex-snapshot
Tractability by Approximating Constraint Languages
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_29openalex-snapshot
A Constraint-Aided Conceptual Design Environment for Autodesk Inventor
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_36openalex-snapshot
A Synthesis of Constraint Satisfaction and Constraint Solving
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_37openalex-snapshot
Maintaining Longest Paths Incrementally
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_38openalex-snapshot
Resolution and Constraint Satisfaction
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_41openalex-snapshot
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_58openalex-snapshot
Semi-automatic Modeling by Constraint Acquisition
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_60openalex-snapshot
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_63openalex-snapshot
Supertree Construction with Constraint Programming
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_64openalex-snapshot
(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_66openalex-snapshot
A Canonicity Test for Configuration
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_69openalex-snapshot
A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0863openalex-snapshot
Symmetry Handling in Mixed‐Integer Programming
inferred← citeshttps://doi.org/10.1002/9780470411353.ch7openalex-snapshot
Solving Constrained Optimization Problems with Hybrid Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1002/9780470612309.ch9openalex-snapshot
GAPLex: Generalized Static Symmetry Breaking
inferred← citeshttps://doi.org/10.1002/oca.807openalex-snapshot
Computational optimal control of the terminal bunt manoeuvre—Part 1: minimum altitude case
inferred← citeshttps://doi.org/10.1007/11402763_11openalex-snapshot
A System Prototype for Solving Multi-granularity Temporal CSP
inferred← citeshttps://doi.org/10.1007/11402763_12openalex-snapshot
Computing Equilibria Using Interval Constraints
inferred← citeshttps://doi.org/10.1007/11402763_15openalex-snapshot
Better Propagation for Non-preemptive Single-Resource Constraint Problems
inferred← citeshttps://doi.org/10.1007/11402763_3openalex-snapshot
Pruning by Equally Constrained Variables
inferred← citeshttps://doi.org/10.1007/11402763_8openalex-snapshot
Automatically Exploiting Symmetries in Constraint Programming
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_25openalex-snapshot
Symmetry and Search in a Network Design Problem
inferred← citeshttps://doi.org/10.1007/11499107_2openalex-snapshot
A Symbolic Search Based Approach for Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/11499107_27openalex-snapshot
Improved Exact Solvers for Weighted Max-SAT
inferred← citeshttps://doi.org/10.1007/11506676_9openalex-snapshot
Specialization of Concurrent Guarded Multi-set Transformation Rules
inferred← citeshttps://doi.org/10.1007/11527695_1openalex-snapshot
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables
inferred← citeshttps://doi.org/10.1007/11527695_15openalex-snapshot
Clause Form Conversions for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/11527695_24openalex-snapshot
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
inferred← citeshttps://doi.org/10.1007/11527695_28openalex-snapshot
The Second QBF Solvers Comparative Evaluation
inferred← citeshttps://doi.org/10.1007/11527862_16openalex-snapshot
A Specialised Binary Constraint for the Stable Marriage Problem
inferred← citeshttps://doi.org/10.1007/11527862_17openalex-snapshot
Compositional Derivation of Symmetries for Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11546207_37openalex-snapshot
Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers
inferred← citeshttps://doi.org/10.1007/11558590_13openalex-snapshot
Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming
inferred← citeshttps://doi.org/10.1007/11564751_113openalex-snapshot
Asymmetric Distributed Constraints Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/11564751_119openalex-snapshot
The Comet Programming Language and System
inferred← citeshttps://doi.org/10.1007/11564751_14openalex-snapshot
Distributed Stable Matching Problems
inferred← citeshttps://doi.org/10.1007/11564751_16openalex-snapshot
Ad-hoc Global Constraints for Life
inferred← citeshttps://doi.org/10.1007/11564751_18openalex-snapshot
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
inferred← citeshttps://doi.org/10.1007/11564751_20openalex-snapshot
Assumption-Based Pruning in Conditional CSP
inferred← citeshttps://doi.org/10.1007/11564751_23openalex-snapshot
Solving the MOLR and Social Golfers Problems
inferred← citeshttps://doi.org/10.1007/11564751_24openalex-snapshot
Advances in Polytime Isomorph Elimination for Configuration
inferred← citeshttps://doi.org/10.1007/11564751_27openalex-snapshot
2 -Way vs.d -Way Branching for CSP
inferred← citeshttps://doi.org/10.1007/11564751_28openalex-snapshot
Maintaining Longest Paths in Cyclic Graphs
inferred← citeshttps://doi.org/10.1007/11564751_30openalex-snapshot
Maximum Constraint Satisfaction on Diamonds
inferred← citeshttps://doi.org/10.1007/11564751_31openalex-snapshot
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
inferred← citeshttps://doi.org/10.1007/11564751_32openalex-snapshot
Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
inferred← citeshttps://doi.org/10.1007/11564751_34openalex-snapshot
Generating Corrective Explanations for Interactive Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11564751_35openalex-snapshot
SPREAD: A Balancing Constraint Based on Statistics
inferred← citeshttps://doi.org/10.1007/11564751_36openalex-snapshot
Automatic Detection of Variable and Value Symmetries
inferred← citeshttps://doi.org/10.1007/11564751_37openalex-snapshot
Breaking All Value Symmetries in Surjection Problems
inferred← citeshttps://doi.org/10.1007/11564751_38openalex-snapshot
AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm
inferred← citeshttps://doi.org/10.1007/11564751_39openalex-snapshot
Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
inferred← citeshttps://doi.org/10.1007/11564751_47openalex-snapshot
Caching Search States in Permutation Problems
inferred← citeshttps://doi.org/10.1007/11564751_48openalex-snapshot
Repair-Based Methods for Quantified CSPs
inferred← citeshttps://doi.org/10.1007/11564751_70openalex-snapshot
Beyond Finite Domains: The All Different and Global Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/11564751_72openalex-snapshot
Approximated Consistency for the Automatic Recording Problem
inferred← citeshttps://doi.org/10.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/11575726_3openalex-snapshot
A Budget-Balanced, Incentive-Compatible Scheme for Social Choice
inferred← citeshttps://doi.org/10.1007/11591191_41openalex-snapshot
Another Complete Local Search Method for SAT
inferred← citeshttps://doi.org/10.1007/11603023_8openalex-snapshot
A Hybrid BDD and SAT Finite Domain Constraint Solver
inferred← citeshttps://doi.org/10.1007/11754602_4openalex-snapshot
Partitioning Based Algorithms for Some Colouring Problems
inferred← citeshttps://doi.org/10.1007/11757375_16openalex-snapshot
Conflict-Directed A* Search for Soft Constraints
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/11779568_46openalex-snapshot
From Demo to Practice the Mexar Path to Space Operations
inferred← citeshttps://doi.org/10.1007/11814948_15openalex-snapshot
Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$
inferred← citeshttps://doi.org/10.1007/11837787_8openalex-snapshot
Integrating Web Resources to Model Protein Structure and Function
inferred← citeshttps://doi.org/10.1007/11844297_22openalex-snapshot
A Multi-level Memetic/Exact Hybrid Algorithm for the Still Life Problem
inferred← citeshttps://doi.org/10.1007/11856290_19openalex-snapshot
Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances
inferred← citeshttps://doi.org/10.1007/11889205_10openalex-snapshot
An Algebraic Characterisation of Complexity for Valued Constraint
inferred← citeshttps://doi.org/10.1007/11889205_13openalex-snapshot
The Minimum Spanning Tree Constraint
inferred← citeshttps://doi.org/10.1007/11941439_5openalex-snapshot
Heyting Domains for Constraint Abduction
inferred← citeshttps://doi.org/10.1007/11963578_8openalex-snapshot
${\cal O}(n \log n)$ Overload Checking for the Cumulative Constraint and Its Application
inferred← citeshttps://doi.org/10.1007/978-1-4020-5571-3_11openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-69577-3_20openalex-snapshot
Optimizing Service Replication and Placement for IoT Applications in Fog Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-04534-4_3openalex-snapshot
Different Classes of Graphs to Represent Microstructures for CSPs
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_18openalex-snapshot
Representative Encodings to Translate Finite CSPs into SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_7openalex-snapshot
Modelling with Option Types in MiniZinc
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_22openalex-snapshot
Detecting Cardinality Constraints in CNF
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_26openalex-snapshot
Simplifying Pseudo-Boolean Constraints in Residual Number Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_9openalex-snapshot
On Reducing Maximum Independent Set to Minimum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-09584-4_6openalex-snapshot
Evaluating Instance Generators by Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_27openalex-snapshot
Discriminating Instance Generation for Automated Constraint Model Selection
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-319-10428-7_40openalex-snapshot
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_41openalex-snapshot
Core-Guided MaxSAT with Soft Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_22openalex-snapshot
Incremental Encoding and Solving of Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-13770-4_8openalex-snapshot
From Declarative Set Constraint Models to “Good” SAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_20openalex-snapshot
A Global Constraint for Graph Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_23openalex-snapshot
O(nlog n) Filtering Algorithms for Unary Resource Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_27openalex-snapshot
Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_28openalex-snapshot
The Challenge of Generating Spatially Balanced Scientific Experiment Designs
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-25938-1_18openalex-snapshot
Introducing esra, a Relational Language for Modelling Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-28645-5_11openalex-snapshot
Machine Learned Heuristics to Improve Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_11openalex-snapshot
Deriving Filtering Algorithms from Constraint Checkers
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_78openalex-snapshot
Choosing Efficient Representations of Abstract Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_17openalex-snapshot
New Developments in Symmetry Breaking in Search Using Computational Group Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_15openalex-snapshot
QuBE++: An Efficient QBF Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-31846-0_13openalex-snapshot
A Software Framework for Automated Negotiation
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_7openalex-snapshot
Applications of General Exact Satisfiability in Propositional Logic Modelling
inferred← citeshttps://doi.org/10.1007/978-3-540-39853-0_42openalex-snapshot
A CSP-Based Interactive Decision Aid for Space Mission Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-40965-6_17openalex-snapshot
Generating Optimal Linear Temporal Logic Monitors by Coinduction
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_121openalex-snapshot
Learning Good Variable Orderings
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_81openalex-snapshot
Symmetry Breaking in Graceful Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_30openalex-snapshot
On the Effectiveness of Looking Ahead in Search for Answer Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_11openalex-snapshot
Necessary Condition for Path Partitioning Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_12openalex-snapshot
A Constraint Programming Approach to the Hospitals / Residents Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_13openalex-snapshot
Best-First AND/OR Search for 0/1 Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_16openalex-snapshot
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_18openalex-snapshot
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_5openalex-snapshot
The “Not-Too-Heavy Spanning Tree” Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-72665-4_19openalex-snapshot
Managing Conditional and Composite CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_14openalex-snapshot
Variable Dependency in Local Search: Prevention Is Better Than Cure
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_18openalex-snapshot
Formalizing Dangerous SAT Encodings
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_4openalex-snapshot
Mapping CSP into Many-Valued SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_8openalex-snapshot
MiniMaxSat: A New Weighted Max-SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_18openalex-snapshot
Counting Minimum Weighted Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_9openalex-snapshot
Improved Exact Algorithms for Counting 3- and 4-Colorings
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_2openalex-snapshot
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_6openalex-snapshot
Distributed Forward Checking May Lie for Privacy
inferred← citeshttps://doi.org/10.1007/978-3-540-73847-3_13openalex-snapshot
Extension of the Top-Down Data-Driven Strategy to ILP
inferred← citeshttps://doi.org/10.1007/978-3-540-74565-5_31openalex-snapshot
A Stochastic Local Search Approach to Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-540-74782-6_37openalex-snapshot
SAT-Based Planning with Minimal-#actions Plans and “soft” Goals
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_12openalex-snapshot
GAC Via Unit Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_16openalex-snapshot
Local Symmetry Breaking During Search in CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_18openalex-snapshot
On Inconsistent Clause-Subsets for Max-SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_22openalex-snapshot
Dealing with Incomplete Preferences in Soft Constraint Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_24openalex-snapshot
MUST: Provide a Finer-Grained Explanation of Unsatisfiability
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_27openalex-snapshot
Dynamic Management of Heuristics for Solving Structured CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_36openalex-snapshot
AND/OR Multi-valued Decision Diagrams for Constraint Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_39openalex-snapshot
Propagation = Lazy Clause Generation
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_42openalex-snapshot
Decomposing Global Grammar Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_43openalex-snapshot
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_47openalex-snapshot
A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_49openalex-snapshot
Hierarchical Hardness Models for SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_50openalex-snapshot
SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_61openalex-snapshot
Sampling Strategies and Variable Selection in Weighted Degree Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-75514-2_7openalex-snapshot
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
inferred← citeshttps://doi.org/10.1007/978-3-540-77345-0_4openalex-snapshot
Physician Scheduling in Emergency Rooms
inferred← citeshttps://doi.org/10.1007/978-3-540-77442-6_5openalex-snapshot
Efficient Reasoning for Nogoods in Constraint Solvers with BDDs
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_10openalex-snapshot
Constraint Patterns and Search Procedures for CP-Based Random Test Generation
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_13openalex-snapshot
A Max-SAT Inference-Based Pre-processing for Max-Clique
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_10openalex-snapshot
Universal Booleanization of Constraint Models
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_15openalex-snapshot
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_18openalex-snapshot
Length-Lex Bounds Consistency for Knapsack Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_28openalex-snapshot
Reformulating Positive Table Constraints Using Functional Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_35openalex-snapshot
Perfect Constraints Are Tractable
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_38openalex-snapshot
Model Restarts for Structural Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-3-540-88309-8_8openalex-snapshot
Using Indexed Finite Set Variables for Set Bounds Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-88562-7_17openalex-snapshot
Large-Scale Design Space Exploration of SSA
inferred← citeshttps://doi.org/10.1007/978-3-540-89197-0_35openalex-snapshot
KT and S4 Satisfiability in a Constraint Logic Environment
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_5openalex-snapshot
On the Integration of Singleton Consistencies and Look-Ahead Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_6openalex-snapshot
Combining Two Structured Domains for Modeling Various Graph Matching Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_71openalex-snapshot
A Constraint Logic Programming Approach to Automated Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-01347-8_60openalex-snapshot
A Reputation-Based Game for Tasks Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-01818-3_18openalex-snapshot
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_12openalex-snapshot
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
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-02777-2_18openalex-snapshot
Cardinality Networks and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_19openalex-snapshot
New Encodings of Pseudo-Boolean Constraints into CNF
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_46openalex-snapshot
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
inferred← citeshttps://doi.org/10.1007/978-3-642-03251-6_8openalex-snapshot
Robust Solutions in Unstable Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_10openalex-snapshot
Online Selection of Quorum Systems for RAMBO Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_13openalex-snapshot
On the Structure of Industrial SAT Instances
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-05258-3_32openalex-snapshot
SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_18openalex-snapshot
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
inferred← citeshttps://doi.org/10.1007/978-3-642-11503-5_19openalex-snapshot
Lazy Explanations for Constraint Propagators
inferred← citeshttps://doi.org/10.1007/978-3-642-12538-6_3openalex-snapshot
Using Knowledge Discovery in Cooperative Strategies: Two Case Studies
inferred← citeshttps://doi.org/10.1007/978-3-642-13033-5_23openalex-snapshot
AC2001-OP: An Arc-Consistency Algorithm for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_24openalex-snapshot
Upper Bounds on the Number of Solutions of Binary Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_28openalex-snapshot
Constraint Programming with Arbitrarily Large Integer Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_4openalex-snapshot
On Matrices, Automata, and Double Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_15openalex-snapshot
A New Hybrid Tractable Class of Soft Constraint Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_17openalex-snapshot
Using Learnt Clauses in maxsat
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_24openalex-snapshot
A Complete Multi-valued SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-16138-4_24openalex-snapshot
High-Level Modeling of Component-Based CSPs
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_34openalex-snapshot
Boosting Local Search Thanks to cdcl
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-21326-7_32openalex-snapshot
A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_3openalex-snapshot
Automated Algorithm Configuration and Parameter Tuning
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_5openalex-snapshot
Learning a Mixture of Search Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_23openalex-snapshot
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_22openalex-snapshot
Revisiting the tree Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_29openalex-snapshot
MaxRPC Algorithms Based on Bitwise Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_38openalex-snapshot
A CSP Solver Focusing on fac Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_4openalex-snapshot
A Constraint Seeker: Finding and Ranking Global Constraints from Examples
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-23786-7_57openalex-snapshot
On Mini-Buckets and the Min-fill Elimination Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_6openalex-snapshot
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-23954-0_41openalex-snapshot
Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions
inferred← citeshttps://doi.org/10.1007/978-3-642-24647-0_1openalex-snapshot
Bounded Rationality in Multiagent Systems Using Decentralized Metareasoning
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-29828-8_11openalex-snapshot
Constraint Optimization Problems and Bounded Tree-Width Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_19openalex-snapshot
Solving the Longest Simple Path Problem with Constraint-Based Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_22openalex-snapshot
Algorithms for Solving Satisfiability Problems with Qualitative Preferences
inferred← citeshttps://doi.org/10.1007/978-3-642-31519-0_11openalex-snapshot
A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_30openalex-snapshot
Perfect Hashing and CNF Encodings of Cardinality Constraints
showing the first 200 of 330 · page through all 330
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.