A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554): Difference between revisions

@@ Property / cites work @@
+Branch-and-cut algorithms for the split delivery vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Heuristics for determining the number of warehouses for storing non-compatible products
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+New formulations for variable cost and size bin packing problems with item fragmentation
+Normal rank
@@ Property / cites work @@
+Mathematical programming algorithms for bin packing problems with item fragmentation
+Normal rank
@@ Property / cites work @@
+Exactly solving packing problems with fragmentation
+Normal rank
@@ Property / cites work @@
+Q3048611
@@ Property / cites work: Q3048611 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing problem with conflicts and item fragmentation
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+Approximation schemes for packing splittable items with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Heuristics and lower bounds for the bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+An approximation scheme for bin packing with conflicts
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Complexity of fragmentable object bin packing and an application
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+Approximation schemes for packing with item fragmentation
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank