Results 11 to 20 of about 4,775,611 (190)
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
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
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
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
A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
Entropy, 2014 Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems.
Zhaolu Guo +4 more
doaj +1 more source
Complexity, 2023 In this paper, a binary variant of a novel nature-inspired metaheuristic algorithm called the nutcracker optimization algorithm (NOA) is presented for binary optimization problems.
Mohamed Abdel-Basset +3 more
doaj +1 more source
A two-phase method for solving continuous rank-one quadratic knapsack problems [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We propose a two-phase algorithm for solving continuous rank-one quadratic knapsack problems (R1QKPs). In particular, we study the solution structure of the problem without the knapsack constraint.
S.E. Monabbati
doaj +1 more source
PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density
Information, 2019 By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit
Yuan Ping +4 more
doaj +1 more source
Binary light spectrum optimizer for knapsack problems: An improved model
Alexandria Engineering Journal, 2023 This paper presents a binary variant of a novel physics-based meta-heuristic optimization algorithm, namely Light spectrum optimizer (LSO), for tackling both the 0–1 knapsack (KP01) and multidimensional knapsack problems (MKP).
Mohamed Abdel-Basset +5 more
doaj +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