Giters

yang123vc / 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

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Search Techniques for the 2D Bin Packing Problem

About

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

Languages

Language:C++ 93.0%Language:C 4.4%Language:Makefile 2.6%