On the public citation graph

Principles and Practice of Constraint Programming – CP 2004

https://doi.org/10.1007/b100482
0 signed · 293 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/11402763_4openalex-snapshot
Trying Again to Fail-First
inferred← citeshttps://doi.org/10.1007/11493853_10openalex-snapshot
A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
inferred← citeshttps://doi.org/10.1007/11493853_11openalex-snapshot
On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price
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_19openalex-snapshot
A Search-Infer-and-Relax Framework for Integrating Solution Methods
inferred← citeshttps://doi.org/10.1007/11493853_22openalex-snapshot
Combination of Among and Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/11493853_26openalex-snapshot
Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
inferred← citeshttps://doi.org/10.1007/11499107_1openalex-snapshot
Solving Over-Constrained Problems with SAT Technology
inferred← citeshttps://doi.org/10.1007/11499107_19openalex-snapshot
DPvis – A Tool to Visualize the Structure of SAT Instances
inferred← citeshttps://doi.org/10.1007/11499107_27openalex-snapshot
Improved Exact Solvers for Weighted Max-SAT
inferred← citeshttps://doi.org/10.1007/11499107_28openalex-snapshot
Quantifier Trees for QBFs
inferred← citeshttps://doi.org/10.1007/11527695_28openalex-snapshot
The Second QBF Solvers Comparative Evaluation
inferred← citeshttps://doi.org/10.1007/11527695_6openalex-snapshot
Looking Algebraically at Tractable Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/11527695_9openalex-snapshot
QBF Reasoning on Real-World Instances
inferred← citeshttps://doi.org/10.1007/11527862_5openalex-snapshot
Implementing an Abstraction Framework for Soft Constraints
inferred← citeshttps://doi.org/10.1007/11558590_16openalex-snapshot
Schedule Robustness Through Broader Solve and Robustify Search for Partial Order Schedules
inferred← citeshttps://doi.org/10.1007/11564096_8openalex-snapshot
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/11564751_10openalex-snapshot
Graph Invariants as Necessary Conditions for Global Constraints
inferred← citeshttps://doi.org/10.1007/11564751_11openalex-snapshot
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
inferred← citeshttps://doi.org/10.1007/11564751_118openalex-snapshot
Proterv-II: An Integrated Production Planning and Scheduling System
inferred← citeshttps://doi.org/10.1007/11564751_119openalex-snapshot
The Comet Programming Language and System
inferred← citeshttps://doi.org/10.1007/11564751_25openalex-snapshot
Planning and Scheduling to Minimize Tardiness
inferred← citeshttps://doi.org/10.1007/11564751_26openalex-snapshot
Search Heuristics and Heavy-Tailed Behaviour
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_33openalex-snapshot
Parallel Local Search in Comet
inferred← citeshttps://doi.org/10.1007/11564751_43openalex-snapshot
Using SAT in QBF
inferred← citeshttps://doi.org/10.1007/11564751_45openalex-snapshot
On Solving Soft Temporal Constraints Using SAT Techniques
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_48openalex-snapshot
Repair-Based Methods for Quantified CSPs
inferred← citeshttps://doi.org/10.1007/11564751_52openalex-snapshot
Factor Analytic Studies of CSP Heuristics
inferred← citeshttps://doi.org/10.1007/11564751_54openalex-snapshot
Evolving Variable-Ordering Heuristics for Constrained Optimisation
inferred← citeshttps://doi.org/10.1007/11564751_57openalex-snapshot
Acquiring Parameters of Implied Global Constraints
inferred← citeshttps://doi.org/10.1007/11564751_58openalex-snapshot
Integrating Benders Decomposition Within Constraint Programming
inferred← citeshttps://doi.org/10.1007/11564751_66openalex-snapshot
Consistency for Quantified Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/11564751_7openalex-snapshot
Incremental Algorithms for Local Search from Existential Second-Order Logic
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_88openalex-snapshot
Modeling Constraint Programs with Software Technology Standards
inferred← citeshttps://doi.org/10.1007/11564751_91openalex-snapshot
LP as a Global Search Heuristic Across Different Constrainedness Regions
inferred← citeshttps://doi.org/10.1007/11564751_98openalex-snapshot
AND/OR Search Spaces and the Semantic Width of Constraint Networks
inferred← citeshttps://doi.org/10.1007/11579427_17openalex-snapshot
An Approach for Dynamic Split Strategies in Constraint Solving
inferred← citeshttps://doi.org/10.1007/11591191_34openalex-snapshot
Treewidth in Verification: Local vs. Global
inferred← citeshttps://doi.org/10.1007/11603023_8openalex-snapshot
A Hybrid BDD and SAT Finite Domain Constraint Solver
inferred← citeshttps://doi.org/10.1007/11610113_93openalex-snapshot
Optimal Task Scheduling Algorithm for Non-preemptive Processing System
inferred← citeshttps://doi.org/10.1007/11754602_2openalex-snapshot
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
inferred← citeshttps://doi.org/10.1007/11754602_9openalex-snapshot
Views and Iterators for Generic Constraint Implementations
inferred← citeshttps://doi.org/10.1007/11757375_11openalex-snapshot
Expected-Case Analysis for Delayed Filtering
inferred← citeshttps://doi.org/10.1007/11757375_13openalex-snapshot
Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP
inferred← citeshttps://doi.org/10.1007/11757375_16openalex-snapshot
Conflict-Directed A* Search for Soft 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_6openalex-snapshot
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs
inferred← citeshttps://doi.org/10.1007/11757375_7openalex-snapshot
The Range Constraint: Algorithms and Implementation
inferred← citeshttps://doi.org/10.1007/11779568_45openalex-snapshot
SEaM: Analyzing Schedule Executability Through Simulation
inferred← citeshttps://doi.org/10.1007/11816171_156openalex-snapshot
The Cooperative Optimization Metaheuristic: Inspiration from Nature and Applications
inferred← citeshttps://doi.org/10.1007/11889205_10openalex-snapshot
An Algebraic Characterisation of Complexity for Valued Constraint
inferred← citeshttps://doi.org/10.1007/11889205_41openalex-snapshot
Generating Propagators for Finite Set Constraints
inferred← citeshttps://doi.org/10.1007/11889205_47openalex-snapshot
Inferring Variable Conflicts for Local Search
inferred← citeshttps://doi.org/10.1007/11889205_7openalex-snapshot
Graph Properties Based Filtering
inferred← citeshttps://doi.org/10.1007/11890393_37openalex-snapshot
Adaptive Enumeration Strategies and Metabacktracks for Constraint Solving
inferred← citeshttps://doi.org/10.1007/11941439_5openalex-snapshot
Heyting Domains for Constraint Abduction
inferred← citeshttps://doi.org/10.1007/11963578_6openalex-snapshot
Not-First and Not-Last Detection for Cumulative Scheduling in ${\cal O}(n^3\log n)$
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-84882-215-3_16openalex-snapshot
A Hybrid Constraint Programming Approach for Nurse Rostering Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_25openalex-snapshot
Models for Radiation Therapy Patient Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_24openalex-snapshot
Underestimation vs. Overestimation in SAT-Based Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_11openalex-snapshot
An Integrated Constraint Programming Approach to Scheduling Sports Leagues with Divisional and Round-Robin Tournaments
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_21openalex-snapshot
Cost Impact Guided LNS
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_23openalex-snapshot
Buffered Resource Constraint: Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_5openalex-snapshot
A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_9openalex-snapshot
Sliced Table Constraints: Combining Compression and Tabular Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-09584-4_1openalex-snapshot
Algorithm Portfolios for Noisy Optimization: Compare Solvers Early
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_13openalex-snapshot
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_15openalex-snapshot
The Balance Constraint Family
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_20openalex-snapshot
Beyond Consistency and Substitutability
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_23openalex-snapshot
A Declarative Paradigm for Robust Cumulative Scheduling
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_3openalex-snapshot
One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_33openalex-snapshot
On the Erdős Discrepancy 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_58openalex-snapshot
Worst-Case Scheduling of Software Tasks
inferred← citeshttps://doi.org/10.1007/978-3-319-18008-3_18openalex-snapshot
ILP and CP Formulations for the Lazy Bureaucrat Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-24403-7_6openalex-snapshot
Generating Non-plagiaristic Markov Sequences with Max Order Sampling
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_88openalex-snapshot
Constraining Special-Purpose Domain Types
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_95openalex-snapshot
A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_96openalex-snapshot
A Web-Based Meeting Scheduling Solver With Privacy Guarantees, Without Trusted Servers
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_11openalex-snapshot
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_17openalex-snapshot
Counting Solutions of Knapsack Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_41openalex-snapshot
The Steel Mill Slab Design Problem Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_42openalex-snapshot
Filtering Atmost1 on Pairs of Set Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_6openalex-snapshot
Multi-stage Benders Decomposition for Optimizing Multicore Architectures
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_15openalex-snapshot
AND/OR Multi-valued Decision Diagrams for Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_35openalex-snapshot
Many Facets of Complexity in Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_10openalex-snapshot
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method
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_20openalex-snapshot
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
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-72397-4_3openalex-snapshot
Modeling the Regular Constraint with Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_8openalex-snapshot
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_21openalex-snapshot
A First Step Towards a Unified Proof Checker for QBF
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_5openalex-snapshot
Circuit Based Encoding of CNF Formula
inferred← citeshttps://doi.org/10.1007/978-3-540-72901-3_2openalex-snapshot
Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_40openalex-snapshot
Generalized Constraint Acquisition
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_9openalex-snapshot
Reformulating Global Constraints: The Slide and Regular Constraints
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-73817-6_8openalex-snapshot
Extracting Microstructure in Binary Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_11openalex-snapshot
A Constraint Store Based on Multivalued Decision Diagrams
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_13openalex-snapshot
Solution Directed Backjumping for QCSP
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_17openalex-snapshot
Encodings of the Sequence Constraint
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_19openalex-snapshot
An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_30openalex-snapshot
Advisors for Incremental Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_31openalex-snapshot
Breaking Symmetry of Interchangeable Variables and Values
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_32openalex-snapshot
Path Consistency by Dual Consistency
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_44openalex-snapshot
Bound-Consistent Deviation Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_45openalex-snapshot
Constructive Interval Disjunction
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_53openalex-snapshot
Min-Domain Ordering for Asynchronous Backtracking
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_8openalex-snapshot
An Efficient Model and Strategy for the Steel Mill Slab Design Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77345-0_19openalex-snapshot
Hierarchical Timetable Construction
inferred← citeshttps://doi.org/10.1007/978-3-540-77345-0_5openalex-snapshot
A Flexible Model and a Hybrid Exact Method for Integrated Employee Timetabling and Production Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-77345-0_7openalex-snapshot
An Evaluation of Certain Heuristic Optimization Algorithms in Scheduling Medical Doctors and Medical Students
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-78604-7_1openalex-snapshot
Adaptive Tabu Tenure Computation in Local Search
inferred← citeshttps://doi.org/10.1007/978-3-540-79355-7_12openalex-snapshot
On the Pursuit of a Standard Language for Object-Oriented Constraint Modeling
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_2openalex-snapshot
A Preprocessor for Max-SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_12openalex-snapshot
Guiding Search in QCSP + with Back-Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_2openalex-snapshot
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
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_47openalex-snapshot
Semi-automatic Generation of CHR Solvers for Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_51openalex-snapshot
On the Efficiency of Impact Based Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-88439-2_10openalex-snapshot
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-89197-0_71openalex-snapshot
Probabilistic Nogood Store as a Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_3openalex-snapshot
Justification-Based Local Search with Adaptive Noise Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_37openalex-snapshot
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
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-89812-2_9openalex-snapshot
Generalizing Global Constraints Based on Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_52openalex-snapshot
Constraint-Level Advice for Shaving
inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_15openalex-snapshot
Hybrid BDD and All-SAT Method for Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_13openalex-snapshot
Open Constraints in a Boundable World
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_14openalex-snapshot
Sequencing and Counting with the multicost-regular Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_19openalex-snapshot
Scalable Load Balancing in Nurse to Patient Assignment Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_20openalex-snapshot
Learning How to Propagate Using Random Probing
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_32openalex-snapshot
Progress on the Progressive Party Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_2openalex-snapshot
Symbolic Techniques in Propositional Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_31openalex-snapshot
Instance-Based Selection of Policies for SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_35openalex-snapshot
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_22openalex-snapshot
Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
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_20openalex-snapshot
Confidence-Based Work Stealing in Parallel Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_28openalex-snapshot
Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_35openalex-snapshot
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_39openalex-snapshot
Dialectic Search
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_4openalex-snapshot
Generating Optimal Stowage Plans for Container Vessel Bays
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_43openalex-snapshot
Efficient Generic Search Heuristics within the EMBP Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_45openalex-snapshot
A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_46openalex-snapshot
SOGgy Constraints: Soft Open Global Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_63openalex-snapshot
Evaluation of Length-Lex Set Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_9openalex-snapshot
Solving Nurse Rostering Problems Using Soft Global Constraints
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-11169-3_7openalex-snapshot
A Knowledge Discovery Approach to Understanding Relationships between Scheduling Problem Structure and Heuristic Performance
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_17openalex-snapshot
Efficient Büchi Universality Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-12165-4_35openalex-snapshot
Combining CSP and Constraint-Based Mining for Pattern Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-12368-9_19openalex-snapshot
On the Security of a Two-Factor Authentication Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-12842-4_7openalex-snapshot
Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_15openalex-snapshot
Consistency Check for the Bin Packing Constraint Revisited
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_26openalex-snapshot
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_37openalex-snapshot
Boosting Set Constraint Propagation for Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_38openalex-snapshot
More Robust Counting-Based Search Heuristics with Alldifferent Constraints
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-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-13800-3_29openalex-snapshot
Understanding TSP Difficulty by Learning from Evolved Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_12openalex-snapshot
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_14openalex-snapshot
Integrating Dependency Schemes in Search-Based QBF Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_6openalex-snapshot
Automated Testing and Debugging of SAT and QBF Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_9openalex-snapshot
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_10openalex-snapshot
Checking-Up on Branch-and-Check
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_13openalex-snapshot
Propagating the Bin Packing Constraint Using Linear Programming
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-15396-9_35openalex-snapshot
Value-Ordering Heuristics: Search Performance vs. Solution Diversity
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_36openalex-snapshot
A New ${\mathcal O}(n^2\log n)$ Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints
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-18378-2_11openalex-snapshot
Using Constraints for Intrusion Detection: The NeMODe System
inferred← citeshttps://doi.org/10.1007/978-3-642-19486-3_7openalex-snapshot
Dynamic Constraint Satisfaction Problems: Relations among Search Strategies, Solution Sets and Algorithm Performance
inferred← citeshttps://doi.org/10.1007/978-3-642-19486-3_8openalex-snapshot
Constraint-Based Modeling and Scheduling of Clinical Pathways
inferred← citeshttps://doi.org/10.1007/978-3-642-20589-7_14openalex-snapshot
Network Monitoring with Constraint Programming: Preliminary Specification and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-21311-3_23openalex-snapshot
Identifying Patterns in Sequences of Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-21332-8_12openalex-snapshot
A Constraint Programming Application for Rotating Workforce Scheduling
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-22110-1_35openalex-snapshot
Synthesizing Cyber-Physical Architectural Models with Real-Time Constraints
showing the first 200 of 293 · page through all 293
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.