Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem

The paper deals with a discontinuous linear knapsack problem of minimizing a linear objective function on a certain nonconnected subset of a polymatroid. The general problem is NP-hard but some practically interesting subclasses are solvable by a polynomial-time algorithm. Bounds of the expense of the solution process are given depending only on the subclass considered. The average-case behaviour is considered, too.