Encoding cardinality constraints using multiway merge selection networks
type: Item
instance of: scholarly article
title: Encoding cardinality constraints using multiway merge selection networks
zbMATH Open document ID: 1432.68417
author: Michał Karpiński
author: Marek Piotrów
published in: Constraints
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68R07
zbMATH DE Number: 7137187
zbMATH Keywords: cardinality constraint
zbMATH Keywords: selection network
zbMATH Keywords: SAT-solver
zbMATH Keywords: SAT encoding
zbMATH Keywords: SAT translation
describes a project that uses: COMiniSatPS
describes a project that uses: MiniSat
describes a project that uses: PBLib
MaRDI profile type: Publication
full work available at URL: s10601-019-09302-0
OpenAlex ID: W2935376254
cites work: A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
cites work: Cardinality networks: a theoretical and empirical study
cites work: Curriculum-based course timetabling with SAT and MaxSAT
cites work: Q3429162
cites work: Pairwise Cardinality Networks
cites work: Q3429154
cites work: Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
cites work: Q4349924
cites work: PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
cites work: A linear-time transformation of linear inequalities into conjunctive normal form
DOI: 10.1007/S10601-019-09302-0
description: scientific article; zbMATH DE number 7137187