Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem | PLOS ONE
Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem | PLOS ONE
Binpacking Example (Branch-and-price): Problem description
On the Approximability of Geometric and Geographic Generalization and the Min- Max Bin Covering Problem Michael T. Goodrich Dept. of Computer Science joint. - ppt download
Bin covering algorithms in the second stage of the lot to order matching problem: Journal of the Operational Research Society: Vol 52, No 11
On-line Bin Covering Algorithms - ppt download
Variable Sized Bin Packing and Bin Covering
Homework – approximation algorithms
An unusual case of bin packing problem – ParaLife
On the Approximability of Geometric and Geographic Generalization and the Min- Max Bin Covering Problem Michael T. Goodrich Dept. of Computer Science joint. - ppt download
GENETIC ALGORITHM FOR BIN PACKING PROBLEM : Kanna, S K Rajesh, Kanna, Rajesh, AD, Jaisree: Amazon.co.uk: Books
PDF) Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items | Fariborz Jolai and Majid Shakhsi-Niaei - Academia.edu
Heuristic and exact algorithms for Generalized Bin Covering Problem | Semantic Scholar
PDF) Two Simple Algorithms for bin Covering.
![PDF] A HYBRID GENETIC ALGORITHM FOR THE K-BOUNDED SEMI-ONLINE BIN COVERING PROBLEM IN BATCHING MACHINES | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/fc8e769201869055f6182d6648b50fbadf9c51b0/2-Figure1-1.png "PDF] A HYBRID GENETIC ALGORITHM FOR THE K-BOUNDED SEMI-ONLINE BIN COVERING PROBLEM IN BATCHING MACHINES | Semantic Scholar")
PDF] A HYBRID GENETIC ALGORITHM FOR THE K-BOUNDED SEMI-ONLINE BIN COVERING PROBLEM IN BATCHING MACHINES | Semantic Scholar
PDF) The near exact bin covering problem
Heuristic and exact algorithms for Generalized Bin Covering Problem
Selfish bin covering
ON-LINE ALGORITHMS FOR BIN-COVERING PROBLEMS WITH KNOWN ITEM DISTRIBUTIONS
PDF) Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem
PDF) A study on exponential-size neighborhoods for the bin packing problem with conflicts
Almost Optimal Inapproximability of Multidimensional Packing Problems
Heuristic and exact algorithms for Generalized Bin Covering Problem | Semantic Scholar
Theoretical Computer Science On Lazy Bin Covering and Packing problems$
BOUNDS
![PDF] Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/6b91768f89337000e44bb63fcee1782374f6a059/2-Figure1-1.png "PDF] Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem | Semantic Scholar")