Results 201 to 210 of about 25,976 (248)
Some of the next articles are maybe not open access.
2021
In this chapter, we design conventional and syntactical circuits for the 0/1 knapsack problem, describe two cost functions for the syntactical circuit, evaluate the number of operations and the time required by the algorithms for the optimization and counting, discuss an example, and show experimental results.
Michal Mankowski, Mikhail Moshkov
openaire +1 more source
In this chapter, we design conventional and syntactical circuits for the 0/1 knapsack problem, describe two cost functions for the syntactical circuit, evaluate the number of operations and the time required by the algorithms for the optimization and counting, discuss an example, and show experimental results.
Michal Mankowski, Mikhail Moshkov
openaire +1 more source
An algorithm for the solution of the 0–1 knapsack problem
Computing, 1982A new implicit enumeration algorithm for the solution of the 0–1 knapsack problem — denoted by FPK 79 — is proposed. The implementation of the associated FORTRAN IV subroutine is then described. Computational results prove the efficiency of this algorithm (practically linear time complexity including the initial arrangement of the data) whose ...
Didier Fayard, Gérard Plateau
openaire +2 more sources
An Algorithm for the 0-1 Equality Knapsack Problem
Journal of the Operational Research Society, 1988The paper deals with the following problem: minimize cx on the set \(\{\) x: \(wx=b\}\). \(x=(x_ 1\),..., \(x_ n)\), \(x_ i=0\) or 1. Here c and w are vectors with rational non-negative coordinates. This is called the equality knapsack problem. A method is developed which computes some candidate solutions and investigates them using branch and bound ...
Ram, Balasubramanian, Sarin, Sanjiv
openaire +3 more sources
Matroidal relaxations for 0–1 knapsack problems
Operations Research Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lígia Amado, Paulo Bárcia
openaire +2 more sources
A hypercube algorithm for the 0/1 Knapsack problem
Journal of Parallel and Distributed Computing, 1988Abstract Many combinatorial optimization problems are known to be NP-complete. A common point of view is that finding fast algorithms for such problems using polynomial number of processors is unlikely. However, facts of this kind usually are established for “worst” case situations and in practice many instances of NP-complete problems are ...
Jong Lee +2 more
openaire +1 more source
The 0-1 knapsack problem with fuzzy data
Fuzzy Optimization and Decision Making, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adam Kasperski, Michal Kulej
openaire +2 more sources
Landscape Properties of the 0-1 Knapsack Problem
Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2015This paper studies two landscapes of different instances of the 0-1 knapsack problem. The instances are generated randomly from varied weight distributions. We show that the variation of the weights can be used to guide the selection of the most suitable local search operator for a given instance.
Khulood AlYahya, Jonathan E. Rowe
openaire +1 more source
An algorithm for the 0/1 Knapsack problem
Mathematical Programming, 1978The Knapsack problem (maximize a linear function, subject to a unique constraint, all being in integers), although of thenp-complete type, is a well solved case in combinatorial programming. The reason for this is twofold:(i)an upper bound of the objective function is easy to compute(ii)it is quite simple to construct feasible solutions.
openaire +2 more sources
The 0-1 Knapsack problem with a single continuous variable [PDF]
Mathematical Programming, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MARCHAND, Hugues, WOLSEY, Laurence A.
openaire +1 more source
An algorithm for 0‐1 multiple‐knapsack problems
Naval Research Logistics Quarterly, 1978AbstractThe 0‐1 multiple‐knapsack problem is an extension of the well‐known 0‐1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized.A branch‐and‐bound algorithm for
Hung, Ming S., Fisk, John C.
openaire +2 more sources