Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,766,421 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithm
Analysis of algorithms
Greedy algorithm
Knapsack problem
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Inverse Fractional Knapsack Problem with Profits and Costs Modification
K. Nguyen
,
Huynh Duc Quoc
arXiv.org
2017
Corpus ID: 12331181
We address in this paper the problem of modifying both profits and costs of a fractional knapsack problem optimally such that a…
Expand
2016
2016
Optimal solution to the fractional knapsack problem for LTE overload-state scheduling
Nasim Ferdosian
,
M. Othman
,
K. Y. Lun
,
B. Ali
International Symposium on Telecommunication…
2016
Corpus ID: 25243657
The growing variety and consumption of the mobile services throughout the Long Term Evolution (LTE) mobile networks lead to…
Expand
2016
2016
Minimizing Bandwidth Requirements for VoD Services with Client Caching
Hao Feng
,
Zhiyong Chen
,
Hui Liu
Global Communications Conference
2016
Corpus ID: 3753649
Due to the explosive growth in multimedia traffic demand, scalability and delivery efficiency of video-on-demand (VoD) services…
Expand
2015
2015
Dynamic Orthogonal Frequency Division Multiple Access resource management for downlink interference avoidance in two‐tier networks
Shang-Juh Kao
,
Hsiu-Lang Wang
International Journal of Communication Systems
2015
Corpus ID: 31188190
In two‐tier networks, which consist of macrocells and femtocells, femtocells can offload the traffic from macrocells thereby…
Expand
2015
2015
On a single machine-scheduling problem with separated position and resource effects
A. Janiak
,
M. Kovalyov
,
M. Lichtenstein
2015
Corpus ID: 123069572
Rudek and Rudek [1] studied a single machine-scheduling problem to minimize the makespan, in which the processing time of each…
Expand
2014
2014
Solving binary and continuous knapsack problems for radio resource allocation over High Altitude Platforms
Ahmed Ibrahim
,
A. Alfa
Wireless Telecommunications Symposium
2014
Corpus ID: 45582741
In this paper, radio resource allocation for multicasting in OFDMA based High Altitude Platforms is considered. An optimization…
Expand
2013
2013
Inter-field routes scheduling and rescheduling for an autonomous tractor fleet at the farm
P. Gutman
,
I. Ioslovich
International Conference on Methods & Models in…
2013
Corpus ID: 9945874
Algorithms for a task controller for autonomous tractors and implements are considered. These algorithms are for the optimal work…
Expand
2010
2010
StegoMos: a secure novel approach of high rate data hidden using mosaic image and ANN-BMP cryptosystem
B. Zaidan
,
A. Zaidan
,
A. Taqa
,
G. M. Alam
,
M. L. M. Kiah
,
A. Jalab
2010
Corpus ID: 14352076
This paper discusses a secure novel approach of high rate data hidden using mosaic image and bitmap (bmp) cryptosystem. The…
Expand
2007
2007
Online Grid Replication Optimizers to Improve System Reliability
Ming Lei
,
Susan V. Vrbsky
,
Zijie Qi
IEEE International Parallel and Distributed…
2007
Corpus ID: 10958160
In a data intensive grid system, many data replica schemes and models have been proposed to improve the system response time or…
Expand
2006
2006
Intelligent Information Processing and Web Mining - Proceedings of the International IIS: IIPWM'06 Conference held in Ustrón, Poland, June 19-22, 2006
M. Klopotek
,
S. Wierzchon
,
K. Trojanowski
Intelligent Information Systems
2006
Corpus ID: 52005765
Regular Sessions: Artificial Immune Systems.- Comparing Energetic and Immunological Selection in Agent-Based Evolutionary…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE