Piecewise convex maximization approach to multiknapsack

We refine the reverse convex approach to binary programs into a piecewise convex maximization problem with only two pieces. As a vital lead, we address the multiknapsack problem. The results of computational experiments are presented in contrast with the best known solutions found by heuristics and by the reverse convex approach.