Improved filtering for the bin-packing with cardinality constraint

Derval, Guillaume; Régin, Jean‐Charles; Schaus, Pierre

doi:10.1007/s10601-017-9278-x

Search citation statements

Order By: Relevance

Paper Sections

Select...

Bin Packing1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2023

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The literature contains various extensions of the bin packing constraint. The authors of [30,25,10] introduce and refine a cardinality reasoning, well suited when there are constraints on the number of items in each bin or when the items have similar weights. In [13], the lower bound is enhanced by considering alternative reductions.…”

Section: Bin Packingmentioning

confidence: 99%

Constraint propagation on GPU: A case study for the AllDifferent constraint

Tardivo

Dovier

Formisano

et al. 2023

Journal of Logic and Computation

View full text Add to dashboard Cite

The AllDifferent constraint is a fundamental tool in Constraint Programming. It naturally arises in many problems, from puzzles to scheduling and routing applications. Such popularity has prompted an extensive literature on filtering and propagation for this constraint. This paper investigates the use of General Processing Units (GPUs) to accelerate filtering and propagation. In particular, the paper presents an efficient parallelization of the AllDifferent constraint on GPU, along with an analysis of different design and implementation choices and evaluation of the performance of the resulting system on several benchmarks.

show abstract