A new branch-and-filter exact algorithm for binary constraint satisfaction problems
From MaRDI portal
Publication:2077912
Recommendations
- New schemes for simplifying binary constraint satisfaction problems
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- A probabilistic analysis of randomly generated binary constraint satisfaction problems.
- Variable Elimination in Binary CSPs
- Recent Advances in Constraints
Cites work
- A branch-and-cut algorithm for the edge interdiction clique problem
- A Computing Procedure for Quantification Theory
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- A new branch-and-bound algorithm for the maximum weighted clique problem
- A new class of binary CSPs for which arc-consistency is a decision procedure
- A new exact maximum clique algorithm for large and massive sparse graphs
- A new upper bound for the maximum weight clique problem
- A Sufficient Condition for Backtrack-Free Search
- A survey of constraint-based programming paradigms
- An exact algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- An improved bit parallel exact maximum clique algorithm
- Backtrack Programming
- Consistency in networks of relations
- Constraint satisfaction problems: Algorithms and applications
- Counting-based search: branching heuristics for constraint satisfaction problems
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Handbook of constraint programming.
- scientific article; zbMATH DE number 6118222 (Why is no real title available?)
- scientific article; zbMATH DE number 4112072 (Why is no real title available?)
- scientific article; zbMATH DE number 1312992 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- scientific article; zbMATH DE number 956851 (Why is no real title available?)
- scientific article; zbMATH DE number 2243409 (Why is no real title available?)
- Improved infra-chromatic bound for exact maximum clique search
- Incremental Upper Bound for the Maximum Clique Problem
- Infra-chromatic bound for exact maximum clique search
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Networks of constraints: Fundamental properties and applications to picture processing
- New schemes for simplifying binary constraint satisfaction problems
- On finding \(k\)-cliques in \(k\)-partite graphs
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Propagation via lazy clause generation
- Radio link frequency assignment
- Random constraint satisfaction: Flaws and structure
- Reducibility among combinatorial problems
- Relaxed approximate coloring in exact maximum clique search
- Search in the patience game `Black Hole'
- Stable Roommates and Constraint Programming
- The maximum clique interdiction problem
- Tree clustering for constraint networks
Cited in
(2)
This page was built for publication: A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077912)
