Results 151 to 160 of about 28,490 (215)
Encounter based energy sharing in wildlife communication systems. [PDF]
Sci RepIranmanesh S, Raad R.
europepmc +1 more source
Bilateral matching decision-making for rural homesteads withdrawal patterns and types of peasant households' welfare needs: Evidence from China in the context of land spatial planning regulation. [PDF]
HeliyonZhu D, Wang Y, Niu Q, Wu Z, Wu L.
europepmc +1 more source
Optimizing microgrid operations with consideration of energy conservation and emission reduction benefits in spatial econometrics. [PDF]
Sci RepZhao B, Guan X, Tao X, Bai Z, Gao S.
europepmc +1 more source
An improved multi-objective particle swarm optimization algorithm for the design of foundation pit of rail transit upper cover project. [PDF]
Sci RepShao J, Lu Y, Sun Y, Zhao L.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
Computers & Operations Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cacchiani V. +3 more
openaire +4 more sources
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 ...
Arkin, Esther M. +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 ...
Arkin, Esther M. +2 more
openaire +1 more source
STATIC STOCHASTIC KNAPSACK PROBLEMS
Probability in the Engineering and Informational Sciences, 2015Two stochastic knapsack problem (SKP) models are considered: the static broken knapsack problem (BKP) and the SKP with simple recourse and penalty cost problem. For both models, we assume: the knapsack has a constant capacity; there are n types of items and each type has an infinite supply; a type i item has a deterministic reward vi and a random ...
Chen, Kai, Ross, Sheldon M.
openaire +1 more source
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