Advertisement
Published in:
1992 | OriginalPaper | Chapter
On Pleasant Knapsack Problems
Author : Béla Vizvári
Published in: Combinatorial Optimization
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper the following knapsack problems will be considered 1$$\max (\min )\{ \sum\nolimits_{j = 1}^n {cjx} j:\sum\nolimits_{j = 1}^n {ajxj} = b,x \in z_ + ^n\}$$ The maximization problem is MAXKP and the other one is MINKP. The constraints are formally the same. We assume that the following regularity conditions are satisfied.