On the public citation graph

Principles and practice of constraint programming - CP 97 : Third International Conference, CP 97, Linz, Austria, October 29 - November 1, 1997 : proceedings

https://doi.org/10.1007/bfb0017424
0 signed · 116 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.1002/9781118033036.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1007/10722311_9openalex-snapshot
Towards a Language for CLP Choice-Tree Visualisation
inferred← citeshttps://doi.org/10.1007/11424918_2openalex-snapshot
Handling Over-Constrained Problems in Distributed Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/11427186_43openalex-snapshot
Efficient and Experimental Meta-heuristics for MAX-SAT Problems
inferred← citeshttps://doi.org/10.1007/11493853_12openalex-snapshot
Constraint Programming Based Column Generation for Employee Timetabling
inferred← citeshttps://doi.org/10.1007/11493853_22openalex-snapshot
Combination of Among and Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/11493853_6openalex-snapshot
Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles
inferred← citeshttps://doi.org/10.1007/11499107_12openalex-snapshot
Diversification and Determinism in Local Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/11499305_5openalex-snapshot
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification
inferred← citeshttps://doi.org/10.1007/11527695_26openalex-snapshot
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver
inferred← citeshttps://doi.org/10.1007/11527862_5openalex-snapshot
Implementing an Abstraction Framework for Soft Constraints
inferred← citeshttps://doi.org/10.1007/11562931_11openalex-snapshot
Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis
inferred← citeshttps://doi.org/10.1007/11562931_14openalex-snapshot
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
inferred← citeshttps://doi.org/10.1007/11564751_26openalex-snapshot
Search Heuristics and Heavy-Tailed Behaviour
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_7openalex-snapshot
Incremental Algorithms for Local Search from Existential Second-Order Logic
inferred← citeshttps://doi.org/10.1007/11564751_8openalex-snapshot
Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs
inferred← citeshttps://doi.org/10.1007/11591191_41openalex-snapshot
Another Complete Local Search Method for SAT
inferred← citeshttps://doi.org/10.1007/11737414_5openalex-snapshot
A Framework for Extended Algebraic Data Types
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/11881223_24openalex-snapshot
A Hybrid Discrete Particle Swarm Algorithm for Hard Binary CSPs
inferred← citeshttps://doi.org/10.1007/11889205_18openalex-snapshot
Adaptive Clause Weight Redistribution
inferred← citeshttps://doi.org/10.1007/11924661_1openalex-snapshot
Type Processing by Constraint Reasoning
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-44957-4_37openalex-snapshot
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_17openalex-snapshot
Components for State Restoration in Tree Search
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_38openalex-snapshot
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_11openalex-snapshot
A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_25openalex-snapshot
A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains
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_54openalex-snapshot
Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports
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-11421-7_5openalex-snapshot
A Distributed Constraint Optimization Approach for Vessel Rotation Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_9openalex-snapshot
Local Search on SAT-encoded Colouring Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_16openalex-snapshot
Combining Forces to Solve the Car Sequencing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_5openalex-snapshot
Sound and Decidable Type Inference for Functional Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_8openalex-snapshot
From Constraints to Finite Automata to Filtering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_17openalex-snapshot
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_41openalex-snapshot
Industrial Application of External Black-Box Functions in Constraint Programming Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_20openalex-snapshot
Region-Based Query Languages for Spatial Databases in the Topological Data Model
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_16openalex-snapshot
Tree Schemata and Fair Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_11openalex-snapshot
hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_7openalex-snapshot
Boosting Chaff’s Performance by Incorporating CSP Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_78openalex-snapshot
A Composition Algorithm for Very Hard Graph 3-Colorability Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_17openalex-snapshot
Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_11openalex-snapshot
A Meta-Heuristic Factory for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_4openalex-snapshot
Operational Equivalence of CHR Programs and Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_10openalex-snapshot
Combining Equational Tree Automata over AC and ACI Theories
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-85928-4_6openalex-snapshot
A Model to Study Phase Transition and Plateaus in Relational Learning
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_43openalex-snapshot
Termination Analysis of CHR Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-92243-8_2openalex-snapshot
A Flexible Search Framework for CHR
inferred← citeshttps://doi.org/10.1007/978-3-540-92243-8_6openalex-snapshot
A Compositional Semantics for CHR with Propagation Rules
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_20openalex-snapshot
Learning How to Propagate Using Random Probing
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_23openalex-snapshot
Hybrid Branching
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_6openalex-snapshot
Backdoors to Combinatorial Optimization: Feasibility and Optimality
inferred← citeshttps://doi.org/10.1007/978-3-642-03751-1_3openalex-snapshot
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03751-1_4openalex-snapshot
A Theoretical Analysis of the k-Satisfiability Search Space
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_51openalex-snapshot
On the Power of Clause-Learning SAT Solvers with Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_25openalex-snapshot
Exact Cover via Satisfiability: An Empirical Study
inferred← citeshttps://doi.org/10.1007/978-3-642-15822-3_2openalex-snapshot
The Complex Gaussian Kernel LMS Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_27openalex-snapshot
Partitioning SAT Instances for Distributed Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_18openalex-snapshot
Between Restarts and Backjumps
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_27openalex-snapshot
Empirical Study of the Anatomy of Modern Sat Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_15openalex-snapshot
A Framework for Decision-Based Consistencies
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-28717-6_11openalex-snapshot
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints
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-31612-8_4openalex-snapshot
Off the Trail: Re-examining the CDCL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_13openalex-snapshot
Improved Termination Analysis of CHR Using Self-sustainability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-33119-0_5openalex-snapshot
On the Application of SAT Solvers to the Test Suite Minimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_29openalex-snapshot
Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_50openalex-snapshot
Revisiting Neighborhood Inverse Consistency on Binary CSPs
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_52openalex-snapshot
A Hybrid Paradigm for Adaptive Parallel Search
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_7openalex-snapshot
An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_23openalex-snapshot
Learning Algorithm Portfolios for Parallel Execution
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_28openalex-snapshot
An Adaptive Model Restarts Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_6openalex-snapshot
Revisiting Hyper Binary Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-58898-3_9openalex-snapshot
Geometric Constraint Decomposition
inferred← citeshttps://doi.org/10.1007/s10601-005-0552-yopenalex-snapshot
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/s10601-006-9011-7openalex-snapshot
Models for Global Constraint Applications
inferred← citeshttps://doi.org/10.1007/s10601-007-9023-yopenalex-snapshot
Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment
inferred← citeshttps://doi.org/10.1007/s12008-014-0210-yopenalex-snapshot
Evaluation of the effectiveness of the interval computation method to simulate the dynamic behavior of subdefinite system: application on an active suspension system
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.112988openalex-snapshot
Adaptive large neighborhood search incorporating mixed-integer linear programming for electric vehicle routing problem with mobile charging and nonlinear battery degradation
inferred← citeshttps://doi.org/10.1016/j.autcon.2024.105839openalex-snapshot
Variable-depth large neighborhood search algorithm for cable routing in distributed photovoltaic systems
inferred← citeshttps://doi.org/10.1016/j.cor.2016.11.012openalex-snapshot
A large neighborhood search heuristic for supply chain network design
inferred← citeshttps://doi.org/10.1016/j.cor.2017.02.001openalex-snapshot
An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
inferred← citeshttps://doi.org/10.1016/j.cor.2017.03.004openalex-snapshot
A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
inferred← citeshttps://doi.org/10.1016/j.cor.2017.04.006openalex-snapshot
An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.11.024openalex-snapshot
Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.07.028openalex-snapshot
A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.07.009openalex-snapshot
The pickup and delivery traveling salesman problem with handling costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.11.035openalex-snapshot
Adaptive Large Neighborhood Search on the Graphics Processing Unit
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.09.010openalex-snapshot
A lexicographic minimax approach to the vehicle routing problem with route balancing
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.06.040openalex-snapshot
A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.08.008openalex-snapshot
A matheuristic for AGV scheduling with battery constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.05.022openalex-snapshot
A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.07.039openalex-snapshot
Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.12.042openalex-snapshot
A large neighborhood search algorithm and lower bounds for the variable-Sized bin packing problem with conflicts
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.08.010openalex-snapshot
A unified solution framework for flexible job shop scheduling problems with multiple resource constraints
inferred← citeshttps://doi.org/10.1016/j.omega.2017.11.003openalex-snapshot
A practical time slot management and routing problem for attended home services
inferred← citeshttps://doi.org/10.1016/j.omega.2023.102941openalex-snapshot
Scheduling aerial resource operations for the extinction of large-scale wildfires
inferred← citeshttps://doi.org/10.1016/j.orp.2025.100344openalex-snapshot
The Robust Steiner Team Orienteering Problem with Decreasing Priorities under budgeted uncertainty
inferred← citeshttps://doi.org/10.1016/j.tre.2016.09.004openalex-snapshot
An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.tre.2024.103826openalex-snapshot
Mobile COVID-19 vaccination scheduling with capacity selection
inferred← citeshttps://doi.org/10.1016/j.tre.2025.103976openalex-snapshot
A multi-mode hybrid electric vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104217openalex-snapshot
Integrated order splitting, allocation, and delivery problem with a synchronized truck and drone fleet
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/s1574-6526(06)80015-5openalex-snapshot
Modelling
inferred← citeshttps://doi.org/10.1038/22055openalex-snapshot
Determining computational complexity from characteristic ‘phase transitions’
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.345.2826openalex-snapshot
Constraint and Integer Programming in OPL
inferred← citeshttps://doi.org/10.1590/0104-530x2359-15openalex-snapshot
Abordagens metaheurísticas para o problema de roteamento de veículos com janelas de tempo e múltiplos entregadores
inferred← citeshttps://doi.org/10.70675/4a8859a0z611ez41eezbcd9zacdf7026c150openalex-snapshot
Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT
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.