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

packing: Update README.md

Browse Source
This commit is contained in:
Corentin Le Molgat
2023-12-04 18:30:04 +01:00
parent 56291e0486
commit 2ee13ed246
1 changed files with 24 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
ortools/packing/README.md
View File

@@ -13,3 +13,27 @@ 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).
Multi-dimensional knapsack solver:
* [`algorithms/knapsack_solver.h`](../algorithms/knapsack_solver.h)
## Bin packing
In an instance of the bin-packing problem, the goal is to use the minimum amount
of bins to fit a series of items of varying size. Vector bin packing (VBP)
considers several dimensions for item size and bin capacity.
More information on
[Wikipedia](https://en.wikipedia.org/wiki/Bin_packing_problem).
Vector bin packing:
* Problem description: [`vector_bin_packing.proto`](vector_bin_packing.proto)
* Solver: [`arc_flow_solver.h`](arc_flow_solver.h)
* VBP parser: [`vector_bin_packing_parser.h`](vector_bin_packing_parser.h)
2D bin packing:
* Problem description:
[`multiple_dimensions_bin_packing.proto`](multiple_dimensions_bin_packing.proto)