Results 101 to 110 of about 28,490 (215)
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
IEEE Access, 2018 The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem (0-1 KP) in which a set of item groups is included and each group consists of three items, whereas at most one of the three items can be packed into the knapsack ...
Yan-Hong Feng, Gai-Ge Wang
doaj +1 more source
THE MULTIPLE-CHOICE KNAPSACK PROBLEM
Journal of the Operations Research Society of Japan, 1978 This paper treats the multiple-choice (continuous) knapsack problem P: n mi n mi maximize L .L cijxijsubjectto(l) I I aij x ij";b,(2)0,,;xij";1,i=I,2, i=l J=l i=l J=1 ... , n, j = 1,2, .... mi and (3) at most one of x il, x i2' ... , x im. is positive for i = 1,2, ., ., n, , where n, mi are positive integers and aij' Cij' bare nonnegative real numbers.
Ibaraki, Toshihide +3 more
openaire +2 more sources
A quantum algorithm for solving 0-1 Knapsack problems
npj Quantum InformationWe present two novel contributions for achieving and assessing quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice.
Sören Wilkening +5 more
doaj +1 more source
Mushroom picking heuristics framework for knapsack-like problems of resource allocation
Zeszyty Naukowe Wyższej Szkoły Finansów i Prawa w Bielsku-BiałejResource allocation is a complex challenge that extends across diverse disciplines, each presenting its distinct considerations and demands. This intricate task involves the distribution of resources in a manner that meets the needs and objectives of ...
Kateryna Czerniachowska
doaj +1 more source
South African Journal of Industrial Engineering, 2012 <p>ENGLISH ABSTRACT: The knapsack problem is a classical optimization problem in which an optimum set of items is chosen according to some or other attribute, and subject to a limiting constraint(bottleneckl.
Keith Sandrock
doaj
Considering a Classical Upper Bound on the Frobenius Number
MathematicsIn this paper, we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integer combination of given, relatively prime, (strictly) positive integers (known as the Frobenius ...
Aled Williams, Daiki Haijima
doaj +1 more source
Energy‐Efficient Knapsack Optimization Using Probabilistic Memristor Crossbars
Advanced Intelligent SystemsConstrained optimization underlies crucial societal problems, for instance, stock trading and bandwidth allocation. However, it is often computationally hard, in that complexity grows exponentially with problem size. The big‐data era urgently demands low‐
Jinzhan Li, Suhas Kumar, Su‐in Yi
doaj +1 more source
Approximate Solutions to the Multiple-Choice Knapsack Problem by Multiobjectivization and Chebyshev Scalarization [PDF]
Operations Research and DecisionsThe method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA solution and it ...
Ewa M. Bednarczuk +2 more
doaj
An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems. [PDF]
Comput Intell Neurosci, 2014 Feng Y, Jia K, He Y.
europepmc +1 more source
An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0-1 knapsack problems. [PDF]
Comput Intell Neurosci, 2014 Feng Y, Wang GG, Feng Q, Zhao XJ.
europepmc +1 more source