pub unsafe extern "C" fn SCIPsolveKnapsackApproximately(
scip: *mut SCIP,
nitems: c_int,
weights: *mut c_longlong,
profits: *mut f64,
capacity: c_longlong,
items: *mut c_int,
solitems: *mut c_int,
nonsolitems: *mut c_int,
nsolitems: *mut c_int,
nnonsolitems: *mut c_int,
solval: *mut f64,
) -> SCIP_RETCODEExpand description
solves knapsack problem in maximization form approximately by solving the LP-relaxation of the problem using Dantzig’s method and rounding down the solution; if needed, one can provide arrays to store all selected items and all not selected items