- CodingTarik/Multiple-Knapsack-Solver: Solves the multiple knapsack problem with a greedy algorithm

Solves the multiple knapsack problem with a greedy algorithm.

This program was originally intended for a coding challenge of GetInIT GmbH and BWI, but can also be useful for productive use.

You need at least Visual Studio 2019

Enter the following command

$ git clone https://.com/CodingTarik/Multiple-Knapsack-Solver.git

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
.vs/BWI Hardwareverteilung		.vs/BWI Hardwareverteilung
Anwendung		Anwendung
Knapsack		Knapsack
Models		Models
Util/Data		Util/Data
ViewModels		ViewModels
assets		assets
bin/Debug/netcoreapp3.1		bin/Debug/netcoreapp3.1
obj		obj
App.xaml		App.xaml
App.xaml.cs		App.xaml.cs
AssemblyInfo.cs		AssemblyInfo.cs
BWI Hardwareverteilung.csproj		BWI Hardwareverteilung.csproj
BWI Hardwareverteilung.csproj.user		BWI Hardwareverteilung.csproj.user
BWI Hardwareverteilung.sln		BWI Hardwareverteilung.sln
LICENSE		LICENSE
MainWindow.xaml		MainWindow.xaml
MainWindow.xaml.cs		MainWindow.xaml.cs
README.md		README.md

Repository files navigation