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
18Updated 14 years ago

Related projects

Alternatives and complementary repositories for 2D-BinPacking