ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Economy
Research
Mathematics
Social Sciences
Architecture and Urbanism
Biology
Physical
Pure sciences
all records (72)

Languages
English
Spanish
Portuguese

Countries
Indonesia
Brazil
USA
Ukraine
Spain
South Africa
Colombia
Mexico
Austria
Chile
all records (72)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
179.590  Articles
1 of 17.959 pages  |  10  records  |  more records»
Web cache refers to the temporary storage of web files/documents. In reality, a set of caches can be grouped into a cluster to improve the server system's performance. In this paper, to achieve the overall cluster efficiency, we propose a w... see more

The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer ... see more

Contex. The problem of constructing a guaranteed suboptimal (approximate) solution with respect to a functional in one-dimensional and multidimensional knapsack problems is considered. The object of the study was a model with an increment of the coefficie... see more

Industrial engineering practices are expected to be affected by, and most likely adapt to, the new paradigms of Industry 4.0. Early indications in practice, as well as extrapolations from the current technology trends, point toward a few fundamental featu... see more

ENGLISH ABSTRACT: The knapsack problem is a classical optimization problem in which an optimum set of items is chosen according to some or other attribute, and subject to a limiting constraint(bottleneckl. The problem is often solv... see more

Parts of the Local Access Telecommunication Network planning problem may be modelled as an Extended Tree Knapsack Problem. The Local Access Telecommunication Network can contribute up to 60% of the total network costs. This paper presents partitioning alg... see more

We show that it is not possible to speed-up the Knapsack problem efficiently in the parallel algebraic decision tree model. More specifically, we prove that any parallel algorithm in the fixed degree algebraic decision tree model that solves the decision ... see more

ENGLISH ABSTRACT: The knapsack problem is a classical optimization problem in which an optimum set of items is chosen according to some or other attribute, and subject to a limiting constraint(bottleneckl. The problem is often solv... see more

Ttraveling thief problem is a combination of the traveling salesman problem and the knapsack problem. traveling thief problem itself is an NP-Hard problem, so most of the problems are solved using a heuristic algorithm and it continues to grow over time.T... see more

1 of 17.959 pages  |  10  records  |  more records»