Consistency Check for the Bin Packing Constraint Revisited

DOI10.1007/978-3-642-13520-0_15zbMath1285.68156OpenAlexW2138242427MaRDI QIDQ3569925

Julien Dupuis, Pierre Schaus, Yves Deville

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_15

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Improved filtering for the bin-packing with cardinality constraint ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

This page was built for publication: Consistency Check for the Bin Packing Constraint Revisited