The knapsack problem with disjoint multiple-choice constraints (original) (raw)
1992, Naval Research Logistics
Related papers
The Linear Multiple Choice Knapsack Problem with Two Criteria: Profit and Equity
We study an extension of the Linear Multiple Choice Knapsack (LMCK) Problem that considers two criteria. The problem can be used to find the optimal allocation of an available resource to a group of disjoint sets of activities, while also ensuring that a certain balance on the resource amounts allocated to the activity sets is attained. The first criterion maximizes the profit incurred by the implementation of the considered activities. The second criterion minimizes the maximum difference between the resource amounts allocated to any two sets of activities. We present the mathematical formulation and explore the fundamental properties of the problem. Based on these properties, we develop an efficient algorithm that obtains the entire frontier of nondominated solutions. The algorithm is very efficient compared to generic multiple objective linear programming (MOLP) algorithms. We present theoretical findings which provide insight into the behavior of the algorithm, and report comput...
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Mathematical Programming, 1985
The multiconstraint 0–1 knapsack problem is encountered when one has to decide how to use a knapsack with multiple resource constraints. Even though the single constraint version of this problem has received a lot of attention, the multiconstraint knapsack problem has been seldom addressed. This paper deals with developing an effective solution procedure for the multiconstraint knapsack problem. Various relaxation
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.