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

Repository navigation

2D-BinPacking

Public

Notifications
Fork (5)
Star (18)

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

Name		Name	Last commit message	Last commit date
.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

Navigation Menu

Repository navigation

About

Repository files navigation

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages