Filtering algorithms for the NValue constraint
type: Item
instance of: scholarly article
title: Filtering algorithms for the NValue constraint
zbMATH Open document ID: 1114.68064
author: Christian Bessiere
author: Emmanuel Hebrard
author: Brahim Hnich
author: Zeynep Kiziltan
author: Toby Walsh
published in: Constraints
publication date: 2007-01-05T00:00:00Z
full work available at URL: constraints06-nvalue.pdf
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5081979
zbMATH Keywords: NP-hard
zbMATH Keywords: pruning
zbMATH Keywords: linear relaxation
zbMATH Keywords: global constraints
describes a project that uses: CHIP
MaRDI profile type: Publication
OpenAlex ID: W2039481115
cites work: Q4475633
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
cites work: Hitting sets when the VC-dimension is small
cites work: Q4198056
cites work: Greed is good: Approximating independent sets in sparse and bounded-degree graphs
cites work: Improved approximations for maximum independent set via approximation chains
cites work: Values of domination numbers of the queen's graph
cites work: Q4475652
DOI: 10.1007/S10601-006-9001-9
description: scientific article; zbMATH DE number 5081979