Enumerating all possible solutions of Knapsack problem

[odow]

all possible solutions

All possible optimal solutions?

This came up a few days ago:

Right solver for JuMP to find every solution of a linear system of equations with integer solutions

No problem. While it’s fresh in my mind, here is a more general solution for future reference: ## Packages using JuMP using Gurobi function example_big_sum(rowsum, colsum; verbose::Bool = true) ## Model: model = Model(Gurobi.Optimizer) @assert length(rowsum) == length(colsum) N = length(rowsum) INDEX = 1:N @variable(model, y[INDEX,INDEX] >= 0, Int) @constraint(model, rowCons[i=INDEX], sum(y[i,j] for j in INDEX) == rowsum[i]) @constraint(model, colCons[j=INDEX…

See the JuMP documentation:

Solutions · JuMP