Results 121 to 130 of about 28,713 (220)

THE KNAPSACK PROBLEM REVISIStED - A SIMPLE AND EFFECTIVE TOOL FOR INDUSiRIAL DECISION-MAKING AT ALL LEVELS

open access: yesSouth 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  

Energy‐Efficient Knapsack Optimization Using Probabilistic Memristor Crossbars

open access: yesAdvanced Intelligent Systems
Constrained 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

Considering a Classical Upper Bound on the Frobenius Number

open access: yesMathematics
In 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

Approximate Solutions to the Multiple-Choice Knapsack Problem by Multiobjectivization and Chebyshev Scalarization [PDF]

open access: yesOperations Research and Decisions
The 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  

New Binary Reptile Search Algorithms for Binary Optimization Problems. [PDF]

open access: yesBiomimetics (Basel)
Crawford B   +8 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy