1. “The Knapsack Problem with Disjoint Multiple-Choice Constrants: Theoretical Results”, Technical Report No. MAS-QM-8402, Department of Management and Systems, Washington State University, Pullman, WA (January, 1984).
2. Minimal spanning tree subject to a side constraint
3. , and , “The Knapsack Problem with Disjoint Multiple-Choice Constraints”, Technical Report No. CS-86-156, Computer Science Department, Washington State University, Pullman, WA (July 1986).
4. A computational study of a multiple-choice knapsack algorithm
5. Minimal ratio spanning trees