Results 171 to 180 of about 33,818 (220)
Some of the next articles are maybe not open access.
Operations Research Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorit S Hochbaum
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorit S Hochbaum
exaly +3 more sources
The Knapsack Problem with Forfeits
2020In this paper we introduce and study the Knapsack Problem with Forfeits. With respect to the classical definition of the problem, we are given a collection of pairs of items, such that the inclusion of both in the solution involves a reduction of the profit.
Cerulli R. +3 more
openaire +2 more sources
A Synchronized Knapsack Problem
2022 8th International Conference on Control, Decision and Information Technologies (CoDIT), 2022We describe here a bi-level Knapsack problem which involves an Eater/Feeder interaction between 2 Knapsack systems. This kind of problem may for instance express the collaboration between a local energy provider and an industrial consumer. We first describe the SFEK: Synchronized Feeder/Eater Knapsack problem in an accurate way, and set an ILP model ...
Bendali, Fatiha +4 more
openaire +1 more source
Algorithmica, 1993
We study a variety of geometric versions of the classical knapsack problem. In particular, we consider the following ``fence enclosure'' problem: Given a set \(S\) of \(n\) points in the plane with values \(v_ i\geq 0\), we wish to enclose a subset of the points with a fence (a simple closed curve) in order to maximize the ``value'' of the enclosure ...
Esther M. Arkin +2 more
openaire +1 more source
We study a variety of geometric versions of the classical knapsack problem. In particular, we consider the following ``fence enclosure'' problem: Given a set \(S\) of \(n\) points in the plane with values \(v_ i\geq 0\), we wish to enclose a subset of the points with a fence (a simple closed curve) in order to maximize the ``value'' of the enclosure ...
Esther M. Arkin +2 more
openaire +1 more source
On the Product Knapsack Problem
Optimization Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Claudia D'Ambrosio +3 more
openaire +4 more sources
On the supermodular knapsack problem
Mathematical Programming, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giorgio Gallo, Bruno Simeone
openaire +2 more sources
A Survey of the Knapsack Problem
2018 International Arab Conference on Information Technology (ACIT), 2018The Knapsack Problem (KP) is one of the most studied combinatorial problems. There are many variations of the problem along with many real life applications. KP seeks to select some of the available items with the maximal total weight in a way that does not exceed a given maximum limit L.
Maram Assi, Ramzi A. Haraty
openaire +1 more source
The stochastic knapsack problem
IEEE Transactions on Communications, 1989A stochastic version of the classical knapsack problem is considered. It is assumed that the K classes of objects arrive according to independent birth processes. An arriving object bypasses the knapsack if insufficient volume is present. The optimization problem is to accept objects as a function of the current system state in order to maximize the ...
Ross, Keith W., Tsang, Danny H.K.
openaire +3 more sources
Operations Research, 1980
We consider a class of algorithms which use the combined powers of branch-and-bound, dynamic programming and rudimentary divisibility arguments for solving the zero-one knapsack problem. Our main result identifies a class of instances of the problem which are difficult to solve by such algorithms.
openaire +1 more source
We consider a class of algorithms which use the combined powers of branch-and-bound, dynamic programming and rudimentary divisibility arguments for solving the zero-one knapsack problem. Our main result identifies a class of instances of the problem which are difficult to solve by such algorithms.
openaire +1 more source
Mathematical Programming, 1977
The fractional knapsack problem to obtain an integer solution that maximizes a linear fractional objective function under the constraint of one linear inequality is considered. A modification of the Dinkelbach's algorithm [3] is proposed to exploit the fact that good feasible solutions are easily obtained for both the fractional knapsack problem and ...
Hiroaki Ishii +2 more
openaire +1 more source
The fractional knapsack problem to obtain an integer solution that maximizes a linear fractional objective function under the constraint of one linear inequality is considered. A modification of the Dinkelbach's algorithm [3] is proposed to exploit the fact that good feasible solutions are easily obtained for both the fractional knapsack problem and ...
Hiroaki Ishii +2 more
openaire +1 more source