0

我正在尝试使用谷歌或工具来实现具有 3 个约束的背包问题。假设我想为每个项目添加一个名为 size 的附加属性。所以每个项目都有 3 个属性，我必须最大化项目的总价值。

KnapsackSolver k = new KnapsackSolver(KnapsackSolver.KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER, "mybin");
        long[, ,] profits = { {{ 10,20,30} ,{40,50,60}} };
        long[,] weights = {{44,21}};
        long[] capa = { 110 };
        k.Init(profits, weights, capa);

但它不会去任何地方。有人可以纠正我。

4

1 回答 1

0

请参阅https://github.com/google/or-tools/blob/stable/examples/dotnet/csknapsack.cs

long[] profits = { 360, 83, 59, 130, 431, 67, 230, 52, 93,
                   125, 670, 892, 600, 38, 48, 147, 78, 256,
                   63, 17, 120, 164, 432, 35, 92, 110, 22,
                   42, 50, 323, 514, 28, 87, 73, 78, 15,
                   26, 78, 210, 36, 85, 189, 274, 43, 33,
                   10, 19, 389, 276, 312 };

long[,] weights = { { 7, 0, 30, 22, 80, 94, 11, 81, 70,
                      64, 59, 18, 0, 36, 3, 8, 15, 42,
                      9, 0, 42, 47, 52, 32, 26, 48, 55,
                      6, 29, 84, 2, 4, 18, 56, 7, 29,
                      93, 44, 71, 3, 86, 66, 31, 65, 0,
                      79, 20, 65, 52, 13 } };

long[] capacities = { 850 };

利润是一个long[] 权重是long[,] 能力是一个long[]。

于 2019-03-23T10:06:49.917 回答