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

语言：C++ · GitHub 星标：18 · Fork：5

在 GitHub 上查看原仓库