yang123vc / 2d-binpacking Goto Github PK
View Code? Open in Web Editor NEWThis project forked from mirath/2d-binpacking
Algorithms that aproximate the solution for the NP-Hard 2D BinPacking Problem. We implement local search first-fit, local search best-fit and Tabu search. The heuristic is first-fit using strips