A new branch-and-filter exact algorithm for binary constraint satisfaction problems
type: Item
instance of: scholarly article
title: A new branch-and-filter exact algorithm for binary constraint satisfaction problems
zbMATH Open document ID: 1490.90255
author: Pablo San Segundo
author: Fabio Furini
author: R. Leon
published in: European Journal of Operational Research
publication date: 2022-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7479751
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: binary constraint satisfaction problems
zbMATH Keywords: constraint programming
zbMATH Keywords: exact algorithm
zbMATH Keywords: computational experiments
describes a project that uses: CPLEX
describes a project that uses: MINION
describes a project that uses: BBMCL
describes a project that uses: DIMACS
describes a project that uses: BBMCSP
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.09.014
OpenAlex ID: W3199595605
cites work: Constraint satisfaction problems: Algorithms and applications
cites work: A survey of constraint-based programming paradigms
cites work: Radio link frequency assignment
cites work: An exact algorithm for the maximum clique problem
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
cites work: Q5687258
cites work: A Computing Procedure for Quantification Theory
cites work: Q3835053
cites work: Tree clustering for constraint networks
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: The maximum clique interdiction problem
cites work: A branch-and-cut algorithm for the edge interdiction clique problem
cites work: Q5435012
cites work: Random constraint satisfaction: Flaws and structure
cites work: Backtrack Programming
cites work: Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Reducibility among Combinatorial Problems
cites work: Incremental Upper Bound for the Maximum Clique Problem
cites work: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
cites work: A new upper bound for the maximum weight clique problem
cites work: Consistency in networks of relations
cites work: Q4254883
cites work: On finding \(k\)-cliques in \(k\)-partite graphs
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q3145804
cites work: New schemes for simplifying binary constraint satisfaction problems
cites work: Propagation via lazy clause generation
cites work: Counting-based search: branching heuristics for constraint satisfaction problems
cites work: Stable Roommates and Constraint Programming
cites work: Q3184605
cites work: Q5715726
cites work: A new branch-and-bound algorithm for the maximum edge-weighted clique problem
cites work: A new branch-and-bound algorithm for the maximum weighted clique problem
cites work: A new exact maximum clique algorithm for large and massive sparse graphs
cites work: An improved bit parallel exact maximum clique algorithm
cites work: Infra-chromatic bound for exact maximum clique search
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: Q4640250
cites work: Relaxed approximate coloring in exact maximum clique search
cites work: Q4954175
DOI: 10.1016/J.EJOR.2021.09.014
description: scientific article; zbMATH DE number 7479751