A new branch-and-filter exact algorithm for binary constraint satisfaction problems
From MaRDI portal
Publication:2077912
DOI10.1016/j.ejor.2021.09.014zbMath1490.90255OpenAlexW3199595605MaRDI QIDQ2077912
Rafael León, Fabio Furini, Pablo San Segundo
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.09.014
combinatorial optimizationcomputational experimentsconstraint programmingexact algorithmbinary constraint satisfaction problems
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infra-chromatic bound for exact maximum clique search
- A new exact maximum clique algorithm for large and massive sparse graphs
- On finding \(k\)-cliques in \(k\)-partite graphs
- A survey of constraint-based programming paradigms
- An exact bit-parallel algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Tree clustering for constraint networks
- Consistency in networks of relations
- Radio link frequency assignment
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- The maximum clique interdiction problem
- A new upper bound for the maximum weight clique problem
- Constraint satisfaction problems: Algorithms and applications
- Networks of constraints: Fundamental properties and applications to picture processing
- An improved bit parallel exact maximum clique algorithm
- A new branch-and-bound algorithm for the maximum weighted clique problem
- A branch-and-cut algorithm for the edge interdiction clique problem
- Relaxed approximate coloring in exact maximum clique search
- Propagation via lazy clause generation
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
- New schemes for simplifying binary constraint satisfaction problems
- A Sufficient Condition for Backtrack-Free Search
- Reducibility among Combinatorial Problems
- Incremental Upper Bound for the Maximum Clique Problem
- Stable Roommates and Constraint Programming
- Backtrack Programming
- A Computing Procedure for Quantification Theory
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2003
- Random constraint satisfaction: Flaws and structure
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
