Results 11 to 20 of about 5,533,689 (197)
Knapsack Problem Solution based on Knapsack Packing Tree Search
Безопасность информационных технологий, 2014 A number of asymmetric cryptosystems (including one of the very first asymmetric cryptosystems – the Merkle–Hellman cryptosystem) are based on the knapsack problem.
Mikhail Andreevich Kupriyashin +1 more
doaj +1 more source
Local and global lifted cover inequalities for the multidimensional knapsack problem [PDF]
, 2008 The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well-known (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upper bounding techniques for the 0-1 MKP have been based on Lagrangian or ...
Kaparis, Konstantinos, Letchford, A N
core +5 more sources
Separation algorithms for 0-1 knapsack polytopes [PDF]
, 2010 Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e., routines for detecting when they are violated.
Letchford, Adam, Kaparis, Konstantinos
core +4 more sources
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures [PDF]
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core +6 more sources
The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem [PDF]
, 2007 In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two-period, two-level, chanced-constrained problem with recourse.
Polukarov, Maria +2 more
core +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
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem [PDF]
, 2008 An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the ...
Salhi, Said +2 more
core +1 more source
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
SHS Web of Conferences, 2022 Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
The Knapsack Problem with Conflict Graphs
Journal of Graph Algorithms and Applications, 2009 We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond
Ulrich Pferschy, Joachim Schauer
doaj +1 more source
Cybernetics and Information Technologies, 2021 Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper,
Rahul Vaddadi Sai +2 more
doaj +1 more source