对背包问题中的物品数量设置最小和最大约束

问题描述

如何使用谷歌或工具求解器对背包中物品的最小和最大（或只是一个固定的常数）数量设置约束？

对于不使用 Google ORTools 求解器的解决方案，我也很乐意接受任何建议......

from ortools.algorithms import pywrapknapsack_solver
solver = pywrapknapsack_solver.KnapsackSolver(
    pywrapknapsack_solver.KnapsackSolver.
    KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,'KnapsackExample')

values = [10,15,1,5,7]
weights = [ [4,2,3],[1,1]]
capacities = [ 6,4 ]
solver = pywrapknapsack_solver.KnapsackSolver(
        pywrapknapsack_solver.KnapsackSolver
        .KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,'Multi-dimensional solver')
solver.Init(values,weights,capacities)
computed_value = solver.solve()
packed_items = []
packed_weights = []
total_weight = 0
print('Total value =',computed_value)
for i in range(len(values)):
    if solver.BestSolutionContains(i):
        packed_items.append(i)
        packed_weights.append(weights[0][i])
        total_weight += weights[0][i]
print('Total weight:',total_weight)
print('Packed items:',packed_items)
print('Packed_weights:',packed_weights)

解决方法

暂无找到可以解决该程序问题的有效方法，小编努力寻找整理中！

如果你已经找到好的解决方法，欢迎将解决方案带上本链接一起发送给小编。

小编邮箱:dio#foxmail.com (将#修改为@）