Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
The authors consider a 0-1 programming problem with two types of variables, selection variables and bounding ones. The first variables describe the content of the problem and the second ones describe resource restrictions. The authors propose two heuristic methods for reducing the values of the bounding variables which is not permitted in previously known methods. The two methods are based on a solution of a special subset sum problem.
scientific article; zbMATH DE number 4149890