Results 21 to 30 of about 5,749 (206)
Algorithms, 2022 Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains.
Stephen A. Adubi +2 more
doaj +1 more source
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
IEEE Access, 2023 Quantum annealing has the potential to outperform classical transistor-based computer technologies in tackling intricate combinatorial optimization problems. However, ongoing scientific debates cast doubts on whether quantum annealing devices (or quantum
Jehn-Ruey Jiang, Chun-Wei Chu
doaj +1 more source
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem [PDF]
INFORMS Journal on Computing, 2014 It is well known that the standard (linear) knapsack problem can be solved exactly by dynamic programming in 𝒪(nc) time, where n is the number of items and c is the capacity of the knapsack. The quadratic knapsack problem, on the other hand, is NP-hard in the strong sense, which makes it unlikely that it can be solved in pseudo-polynomial time.
Franklin Djeumou Fomeni +1 more
openaire +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
Gradual sub-lattice reduction and a new complexity for factoring polynomials [PDF]
, 2009 We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short.
A. Akhavi +15 more
core +5 more sources
Translating Constraints into QUBOs for the Quadratic Knapsack Problem
, 2023 One of the first fields where quantum computing will likely show its use is optimisation. Many optimisation problems naturally arise in a quadratic manner, such as the quadratic knapsack problem. The current state of quantum computers requires these problems to be formulated as a quadratic unconstrained binary optimisation problem, or QUBO. Constrained
Tariq Bontekoe +2 more
openaire +3 more sources
Store-and-forward based methods for the signal control problem in large-scale congested urban road networks [PDF]
, 2009 The problem of designing network-wide traffic signal control strategies for large-scale congested urban road networks is considered. One known and two novel methodologies, all based on the store-and-forward modeling paradigm, are presented and compared ...
Abu-Lebdeh +19 more
core +1 more source
Estimation of Distribution Algorithm Based on Lévy Flight for Solving the Set-Union Knapsack Problem
IEEE Access, 2019 This article investigates how to use the estimation of distribution algorithm based on Lévy flight to solve the set-union knapsack problem (SUKP). First, the mathematical model of the SUKP is introduced.
Xue-Jing Liu, Yi-Chao He
doaj +1 more source
Recovery of binary sparse signals from compressed linear measurements via polynomial optimization [PDF]
, 2019 The recovery of signals with finite-valued components from few linear measurements is a problem with widespread applications and interesting mathematical characteristics.
Abuabiah, Mohammad, Fosson, Sophie M.
core +2 more sources