Knapsack Problems

By G. Kovács, B. Vizvári. 2008

Citations in the corpus

Neural Combinatorial Optimization with Reinforcement Learning (2016, neutral): “Learning from examples in such a way is undesirable for NP-hard problems because (1) the performance of the model is tied to the quality of the supervised labels, (2) getting high-quality labeled data is expensive and may be infeasible for new problem statements, (3) one cares more about ﬁnding a co”
Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey (2016, unknown): “The goal is to find subset S of objectives that maximizes v(S) subject to the constraint w(S) ≤ M, where v(S) = i∈S vi and w(S) = ∑ i∈S wi [93].”
The Algorithm Design Manual (2020, unknown): “Keller, Pferschy, and Psinger [KPP04] is a solid reference on the knapsack problem and variants.”
Integer and Combinatorial Optimization (2013, unknown): “A more useful description can be obtained in one of two ways, described next. The first approach is to apply the powerful machinery of polyhedral theory. Weyl (1935) established the fact that a polyhedron can either be defined as the intersection of finitely many half-spaces, i.”
Chapter 3 – The Cross-Entropy Method for Optimization (2013, unknown): “A well-known NP-complete combinatorial optimization problem is the 0-1 knapsack problem (Kellerer et al. 2004) defined as: max x n j=1 p j x j , x j ∈ {0, 1}, j = 1, . . . , n , subject to : n j=1 w i,j x j c i , i = 1, . . . , m .”
Preference programming for robust portfolio modeling and project selection (2007, unknown): “…to each resource type, the problem of maximizing the overall value with ﬁxed (extreme point) weights is a knapsack problem, whereby an upper bound with regard to a single resource can be expressed in closed form through a continuous relaxation of the knapsack problem (Marthello and Toth, 1990).”
A scalable application placement controller for enterprise data centers (2007, unknown): “Placement problems have also been studied in the optimization literature, including bin packing, multiple knapsack, and multi-dimensional knapsack problems [7].”
Improved Online Algorithms for Knapsack and GAP in the Random Order Model (2020, unknown): “This example from [25] illustrates the knapsack problem : Given a set of n items, speciﬁed by a size and a proﬁt value, and a resource (called knapsack) of ﬁxed capacity, the goal is to ﬁnd a subset of items (called packing) with maximum total proﬁt and whose total size does not exceed the capacity.”
Vehicle Routing Problems for Drone Delivery (2016, unknown): “If it is preferable to combine discrete battery sizes instead, it can be shown that finding the optimal combination of batteries that minimizes cost while providing enough energy to complete the route is a minimum knapsack problem [38].”
Power and Channel Allocation for Non-Orthogonal Multiple Access in 5G Systems: Tractability and Computation (2016, unknown): “A classical example is the knapsack problem with integer coefficients [31].”
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013, unknown): “When both f and g are modular, Problems 1 and 2 are called knapsack problems [16].”