Results 11 to 20 of about 33,818 (220)
Knapsack problems in groups [PDF]
Mathematics of Computation, 2014 28 pages, 12 ...
Alexei G. Myasnikov +2 more
openaire +2 more sources
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract The Internet of Things is emerging as a crucial technology in aiding humans and making their lives easier. Among the human population, a large percentage of people suffer from disabilities resulting in challenges in everyday life particularly people with visual disabilities.
Hania Tarik +8 more
wiley +1 more source
Knapsack problems with setups [PDF]
European Journal of Operational Research, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Michel +2 more
openaire +3 more sources
On the Robust Knapsack Problem [PDF]
SIAM Journal on Optimization, 2013 We consider an uncertain variant of the knapsack problem that arises when the exact weight of each item is not exactly known in advance but belongs to a given interval, and the number of items whose weight differs from the nominal value is bounded by a constant.
MONACI, MICHELE, U. Pferschy
openaire +4 more sources
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem [PDF]
Mathematical Methods of Operations Research, 2020 AbstractIn this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the product of two separate knapsack profits subject to a cardinality constraint. We propose a polynomial time algorithm for this problem that provides a constant approximation ratio of 4.5.
Britta Schulze +5 more
openaire +2 more sources
On the rectangular knapsack problem
Mathematical Methods of Operations Research, 2022 AbstractA recent paper by Schulze et al. (Math Methods Oper Res 92(1):107–132, 2020) presented the Rectangular Knapsack Problem (Rkp) as a crucial subproblem in the study on the Cardinality-constrained Bi-objective Knapsack Problem (Cbkp). To this end, they started an investigation into its complexity and approximability.
Fritz Bökler +2 more
openaire +2 more sources
Knapsack problems in products of groups [PDF]
, 2015 The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and direct products on their time complexity.
Frenkel, Elizaveta +2 more
core +1 more source
A Deep Reinforcement Learning-Based Scheme for Solving Multiple Knapsack Problems
Applied Sciences, 2022 A knapsack problem is to select a set of items that maximizes the total profit of selected items while keeping the total weight of the selected items no less than the capacity of the knapsack.
Giwon Sur +3 more
doaj +1 more source
A novel approach for solving travelling thief problem using enhanced simulated annealing [PDF]
PeerJ Computer Science, 2021 Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques.
Hamid Ali +5 more
doaj +2 more sources
Improved Online Algorithms for Knapsack and GAP in the Random Order Model [PDF]
, 2019 The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity.
Albers, Susanne +2 more
core +2 more sources