Results 101 to 110 of about 33,491 (214)

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

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  

A Hybrid Machine Learning–Metaheuristic Approach to Solving the Quadratic Multidimensional Knapsack Problem

Mathematics
The quadratic multidimensional knapsack problem (QMdKP) is a combinatorial optimization problem that involves selecting a subset of items to maximize both linear and quadratic profits without exceeding the capacity constraints across multiple dimensions.
Jorge Tapia-Oñate, Carlos Rey
doaj   +1 more source

On Solving the Knapsack Problem with Conflicts

Mathematics
A variant of the well-known Knapsack Problem is studied in this paper. In the classic problem, a set of items is given, with each item characterized by a weight and a profit.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

Revenue maximization in the dynamic knapsack problem [PDF]

We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents.
Dizdar, Deniz, Gershkov, Alex, Moldovanu, Benny   +2 more
core   +1 more source

OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE

Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019
The knapsack problem is analyzed on the basis of the mathematical model, which uses the means of multicriterial optimization. The method which defines possible redundancy of the initial data set is offered for the problem. The algorithm of the transition
S. V. Chebakov, L. V. Serebryanaya
doaj  

Distribution of Computational Load between Processors in an Exact Solution of the Knapsack Problem with Exhaustive Search

Безопасность информационных технологий, 2015
Keywords:  In this paper, we propose a new approach to the definition of basic problems in a constructive enumeration of combinations of knapsack vector elements.
Georgii Ivanovich Borzunov, Mikhail Andreevich Kupriyashin   +1 more
doaj  

A portfolio selection model based on the knapsack problem under uncertainty. [PDF]

PLoS One, 2019
Vaezi F, Sadjadi SJ, Makui A.
europepmc   +1 more source

How Humans Solve Complex Problems: The Case of the Knapsack Problem. [PDF]

Sci Rep, 2016
Murawski C, Bossaerts P.
europepmc   +1 more source

Combinatorial efficiency evaluation: the knapsack problem in data envelopment analysis. [PDF]

ScientificWorldJournal, 2014
Qi XG, Guo B.
europepmc   +1 more source

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

Operations 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, Ignacy Kaliszewski, Janusz Miroforidis   +2 more
doaj