Results 151 to 160 of about 33,491 (214)
Charging Scheduling Method for Wireless Rechargeable Sensor Networks Based on Energy Consumption Rate Prediction for Nodes. [PDF]
Sensors (Basel)Huang S, Sha C, Zhu X, Wang J, Wang R.
europepmc +1 more source
Efficient optimization accelerator framework for multi-state spin Ising problems. [PDF]
Nat CommunGarg C, Salahuddin S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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 +2 more sources
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
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 ...
Ishii, Hiroaki +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 ...
Ishii, Hiroaki +2 more
openaire +1 more source