Results 121 to 130 of about 5,533,689 (197)

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

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

Models for the optimization of promotion campaigns: exact and heuristic algorithms. [PDF]

This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign.
Leus, Roel, Talla Nobibon, Fabrice, Spieksma, Frederik   +2 more
core  

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  

Solving the 0/1 knapsack problem by a biomolecular DNA computer. [PDF]

Adv Bioinformatics, 2013
Taghipour H, Rezaei M, Esmaili HA.
europepmc   +1 more source

Knapsack problem

, 2018
To knapsack problem μελετάται για περισσότερο από έναν αιώνα, με αφετηρία περίπου το 1897. Από τα τέλη της δεκαετίας του 50, ο Tobias Dantzing (1884- 1956) ξεκίνησε τη μελέτη των Knapsack problems και έκτοτε η έρευνα τους εντάθηκε για δύο σημαντικούς ...
Αθανασοπούλου, Δήμητρα
core  

The multiple knapsack problem

, 2010
The knapsack problem is one of the classical operations research problems. It belongs to the category of integer linear programming problems and is most often formulated as a binary problem.
Černý, Vít
core  

Knapsack problem - An illustrative example

In large amusement parks like Europa Park, it is difficult for visitors to accurately plan their time while considering all restrictions. Visitors may face the challenge of choosing attractions that balance fun with safety and practicality, taking into ...
Bogdan, Anastasia
core  

nalisis Penyelesaian Kasus Knapsack Secara Zero-One dengan Teknik Backtracking

, 2005
The knapsack problem is aparticular type of integer program with one constraint only. It is concerned with the task of selecting objects to be packed into a knapsack. Each object that can go into the knapsack haia size and a benefit (profit).
Sulistyo, Wiwin
core