如何解决对背包问题中的物品数量设置最小和最大约束
如何使用谷歌或工具求解器对背包中物品的最小和最大（或只是一个固定的常数）数量设置约束？
对于不使用 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 举报，一经查实，本站将立刻删除。
