Skip to search formSkip to main contentSkip to account menu

Continuous knapsack problem

Known as: Continuous-knapsack problem, Fractional knapsack problem 
In theoretical computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We address in this paper the problem of modifying both profits and costs of a fractional knapsack problem optimally such that a… 
2016
2016
The growing variety and consumption of the mobile services throughout the Long Term Evolution (LTE) mobile networks lead to… 
2016
2016
Due to the explosive growth in multimedia traffic demand, scalability and delivery efficiency of video-on-demand (VoD) services… 
2015
2015
In two‐tier networks, which consist of macrocells and femtocells, femtocells can offload the traffic from macrocells thereby… 
2015
2015
Rudek and Rudek [1] studied a single machine-scheduling problem to minimize the makespan, in which the processing time of each… 
2014
2014
In this paper, radio resource allocation for multicasting in OFDMA based High Altitude Platforms is considered. An optimization… 
2013
2013
Algorithms for a task controller for autonomous tractors and implements are considered. These algorithms are for the optimal work… 
2010
2010
This paper discusses a secure novel approach of high rate data hidden using mosaic image and bitmap (bmp) cryptosystem. The… 
2007
2007
In a data intensive grid system, many data replica schemes and models have been proposed to improve the system response time or… 
2006
2006
Regular Sessions: Artificial Immune Systems.- Comparing Energetic and Immunological Selection in Agent-Based Evolutionary…