always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

packing: Add README.md

Browse Source
This commit is contained in:
Corentin Le Molgat
2023-11-06 11:19:29 +01:00
parent fe0e77dd2f
commit 95a6f84bc6
1 changed files with 15 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
ortools/packing/README.md Normal file
View File

@@ -0,0 +1,15 @@
# Packing
This folder contains utilities and solvers for several packing problems:
knapsack and bin packing, including generalizations. The solvers take as input a
problem description in ProtoBuf.
## Knapsack
A typical knapsack problem considers a single container (the knapsack) and many
items. The container has a maximum capacity, items have both a weight and a
value. The goal is to find the subset of items that respects the capacity
constraint and has the maximum value. There can be only one container. More
generally, the knapsack problem models resource allocation.
More information on [Wikipedia](https://en.wikipedia.org/wiki/Knapsack_problem).