Journal ArticleDOI
The multidimensional 0–1 knapsack problem: An overview
TLDR
This paper surveys the main results of the multidimensional 0–1 knapsack problem and focuses on the theoretical properties as well as approximate or exact solutions of this special 0-1 program.About:
This article is published in European Journal of Operational Research.The article was published on 2004-05-16. It has received 444 citations till now. The article focuses on the topics: Continuous knapsack problem & Knapsack problem.read more
Citations
More filters
Journal ArticleDOI
Wireless Charging Technologies: Fundamentals, Standards, and Network Applications
TL;DR: In this paper, the authors present a comprehensive overview of wireless charging techniques, the developments in technical standards, and their recent advances in network applications, with regard to network applications and discuss open issues and challenges in implementing wireless charging technologies.
Proceedings ArticleDOI
Server-storage virtualization: integration and load balancing in data centers
TL;DR: The design of an agile data center with integrated server and storage virtualization technologies is described and a novel load balancing algorithm called VectorDot is proposed for handling the hierarchical and multi-dimensional resource constraints in such systems.
Proceedings ArticleDOI
Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework
TL;DR: Two families of fairness functions are developed that provide different tradeoffs, characterize the effect of user requests' heterogeneity, and prove conditions under which these fairness measures satisfy the Pareto efficiency, sharing incentive, and envy-free properties.
Journal ArticleDOI
Joint Optimization of Service Caching Placement and Computation Offloading in Mobile Edge Computing Systems
TL;DR: A single edge server that assists a mobile user in executing a sequence of computation tasks is considered, and a mixed integer non-linear programming (MINLP) is formulated that jointly optimizes the service caching placement, computation offloading decisions, and system resource allocation.
Journal ArticleDOI
The Multidimensional Knapsack Problem: Structure and Algorithms
TL;DR: The extensive computational experiments show the effectiveness of the proposed methods, which yield highly competitive results in significantly shorter run times than do previously described approaches.
References
More filters
Book
Dynamic Programming
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Journal ArticleDOI
What is dynamic programming
TL;DR: Sequence alignment methods often use something called a 'dynamic programming' algorithm, which can be a good idea or a bad idea, depending on the method used.
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.