Improved filtering for the bin-packing with cardinality constraint (Q1617384): Difference between revisions

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