From 2ee13ed246a5fc138c0c93b6060cd74e53927996 Mon Sep 17 00:00:00 2001 From: Corentin Le Molgat Date: Mon, 4 Dec 2023 18:30:04 +0100 Subject: [PATCH] packing: Update README.md --- ortools/packing/README.md | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/ortools/packing/README.md b/ortools/packing/README.md index 027a57638d..40cc6cc0fb 100644 --- a/ortools/packing/README.md +++ b/ortools/packing/README.md @@ -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)