Improved filtering for the bin-packing with cardinality constraint

DOI10.1007/s10601-017-9278-xzbMath1402.90144OpenAlexW2761016055MaRDI QIDQ1617384

Guillaume Derval, Jean-Charles Régin, Pierre Schaus

Publication date: 8 November 2018

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-017-9278-x

zbMATH Keywords

flowsconstraintscardinalitybin-packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• OscaR

Cites Work

• Recent advances on two-dimensional bin packing problems
• Lower bounds and reduction procedures for the bin packing problem
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• How efficient is a global constraint in practice? A fair experimental framework
• An exact algorithm for the dual bin packing problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Finding minimum-cost circulations by canceling negative cycles
• Consistency Check for the Bin Packing Constraint Revisited
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Improved filtering for the bin-packing with cardinality constraint