Results 191 to 200 of about 25,976 (248)

Integrated Quality of Service for Offline and Online Services in Edge Networks via Task Offloading and Service Caching. [PDF]

Sensors (Basel)
Zhan C, Zheng S, Chen J, Liang J, Zhou X.   +4 more
europepmc   +1 more source

Model-Based Algorithms for the 0-1 Time-Bomb Knapsack Problem

Roberto Montemanni, Derek H. Smith
openalex   +1 more source

Development of crow search algorithm using the characteristics of qubits and application of engineering problems. [PDF]

Sci Rep
Lee D, Lee S.
europepmc   +1 more source

Rationing in an Era of Multiple Tight Constraints: Is Cost-Utility Analysis Still Fit for Purpose? [PDF]

Appl Health Econ Health Policy
Dakin H, Tsiachristas A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Minimal Algorithm for the 0-1 Knapsack Problem

Operations Research, 1997
Several types of large-sized 0-1 Knapsack Problems (KP) may be easily solved, but in such cases most of the computational effort is used for sorting and reduction. In order to avoid this problem it has been proposed to solve the so-called core of the problem: a Knapsack Problem defined on a small subset of the variables. The exact core cannot, however,
David Pisinger
exaly   +3 more sources

A New Algorithm for the 0-1 Knapsack Problem

Management Science, 1988
We present a new algorithm for the optimal solution of the 0-1 Knapsack problem, which is particularly effective for large-size problems. The algorithm is based on determination of an appropriate small subset of items and the solution of the corresponding “core problem”: from this we derive a heuristic solution for the original problem which, with ...
Silvano Martello
exaly   +3 more sources

The multidimensional 0–1 knapsack problem: An overview

European Journal of Operational Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +2 more sources

The Collapsing 0–1 Knapsack Problem

Mathematical Programming, 1978
The "Collapsing 0---1 Knapsack Problem" is a type of non-linear knapsack problem in which the knapsack size is a non-increasing function of the number of items included. An algorithm is developed and computational results included.
Marc E. Posner, Monique Guignard 0001
openaire   +1 more source

Adjacency of the 0–1 knapsack problem

Computers & Operations Research, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Geist, Ervin Y. Rodin
openaire   +2 more sources