Model-based inference in CHARME.
From MaRDI portal
Publication:1342427
DOI10.1007/BF01720708zbMath0938.68821OpenAlexW2037332142MaRDI QIDQ1342427
Andreas Drexl, Erwin Pesch, Antoon W. J. Kolen
Publication date: 21 June 2000
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720708
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Constraint propagation, relational arithmetic in AI systems and mathematical programs
- A logic language for combinatorial optimization
- Comments on Mohr and Henderson's path consistency algorithm
- Constraint propagation with interval labels
- Network-based heuristics for constraint-satisfaction problems
- Some fundamental properties of local constraint propagation
- An optimal k-consistency algorithm
- From local to global consistency
- A generic arc-consistency algorithm and its specializations
- Constraint satisfaction using constraint logic programming
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Reasoning about qualitative temporal information
- Consistency in networks of relations
- A language and a program for stating and solving combinatorial problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
- Constraint relaxation may be perfect
- A sufficient condition for backtrack-bounded search
- A Sufficient Condition for Backtrack-Free Search
- Constraint logic programming for reasoning about discrete event processes
- Backtrack programming techniques
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
- Solving large combinatorial problems in logic programming
