GitHub - 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

mirath / 2D-BinPacking Public

Notifications You must be signed in to change notification settings
Fork 5
Star 18

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

18 stars 5 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
.gitignore		.gitignore
FiniteBestStrip.cpp		FiniteBestStrip.cpp
FiniteBestStrip.h		FiniteBestStrip.h
HFirstBest.cpp		HFirstBest.cpp
HFirstBest.h		HFirstBest.h
Makefile		Makefile
README		README
dataStructs.cpp		dataStructs.cpp
dataStructs.h		dataStructs.h
utils.cpp		utils.cpp
utils.h		utils.h

Repository files navigation

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

Readme

Activity

18 stars

2 watching

5 forks

Report repository