Exploiting subproblem dominance in constraint programming
type: Item
instance of: scholarly article
title: Exploiting subproblem dominance in constraint programming
zbMATH Open document ID: 1247.68249
author: Geoffrey Chu
author: Maria Garcia De La Banda
author: Peter J. Stuckey
published in: Constraints
publication date: 2012-09-27T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6087656
zbMATH Keywords: caching
zbMATH Keywords: dominance
zbMATH Keywords: search
describes a project that uses: MiniZinc
describes a project that uses: CHIP
describes a project that uses: Gecode
MaRDI profile type: Publication
full work available at URL: s10601-011-9112-9
OpenAlex ID: W2095067556
cites work: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
cites work: Q3241581
cites work: Q4475624
cites work: Q3624058
cites work: Dynamic programming to minimize the maximum number of open stacks
cites work: Conditional Symmetry Breaking
cites work: Propagation via lazy clause generation
cites work: Caching Search States in Permutation Problems
DOI: 10.1007/S10601-011-9112-9
description: scientific article; zbMATH DE number 6087656