Results 21 to 30 of about 33,491 (214)

Dynamic Multidimensional Knapsack Problem benchmark datasets

Systems and Soft Computing, 2022
With increasing research on solving Dynamic Optimization Problems (DOPs), many metaheuristic algorithms and their adaptations have been proposed to solve them.
Jonas Skackauskas, Tatiana Kalganova
doaj   +1 more source

Online Minimization Knapsack Problem

Theoretical Computer Science, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Xin, Makino, Kazuhisa
openaire   +2 more sources

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, Xuezhi Yue, Kejun Zhang, Shenwen Wang, Zhijian Wu   +4 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

A Binary Multi-Scale Quantum Harmonic Oscillator Algorithm for 0–1 Knapsack Problem With Genetic Operator

IEEE Access, 2019
The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack ...
Yan Huang, Peng Wang, Jianping Li, Xiuhong Chen, Tao Li   +4 more
doaj   +1 more source

Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits [PDF]

, 2011
In the stochastic knapsack problem, we are given a knapsack of size B, and a set of jobs whose sizes and rewards are drawn from a known probability distribution. However, we know the actual size and reward only when the job completes.
Gupta, Anupam, Krishnaswamy, Ravishankar, Molinaro, Marco, Ravi, R.   +3 more
core   +2 more sources

Topology Knapsack Problem for Geometry Optimization

IEEE Access
The knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack ...
Hsiao-Hui Li, Po-Chun Chang, Yuan-Hsun Liao   +2 more
doaj   +1 more source

Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division

IEEE Access, 2019
Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model.
Lian Ye, Jinhang Zheng, Ping Guo, Mario J. Perez-Jimenez   +3 more
doaj   +1 more source

Stochastic Vehicle Routing with Recourse [PDF]

, 2012
We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization problem, where demand is satisfied using two routes: fixed and recourse.
A. Ak, A. Gupta, A. Gupta, A. Schrijver, A.L. Erera, A.M. Campbell, B.C. Dean, C. Chekuri, D.B. Shmoys, D.B. Shmoys, D.B. Shmoys, D.J. Bertsimas, D.J. Bertsimas, G. Calinescu, G. Konjevod, I. Katriel, J.K. Lenstra, J.R. Birge, K. Altinkemer, M. Charikar, M. Dror, M. Haimovich, M.W.P. Savelsbergh, N. Bansal, N. Garg, R. Ravi, W. Stewart   +26 more
core   +1 more source

Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem

IEEE Access, 2020
This paper introduces a heuristic solver based on neural networks and deep learning for the knapsack problem. The solver is inspired by mechanisms and strategies used by both algorithmic solvers and humans.
Hazem A. A. Nomer, Khalid Abdulaziz Alnowibet, Ashraf Elsayed, Ali Wagdy Mohamed   +3 more
doaj   +1 more source