Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving
Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
A computational study of a multiple-choice knapsack algorithm
ACM Transactions on Mathematical Software (TOMS)
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Pareto-optimization-based run-time task scheduling for embedded systems
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
SLA based profit optimization in web systems
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
SLA based profit optimization in autonomic computing systems
Proceedings of the 2nd international conference on Service oriented computing
Resource Allocation Framework for Distributed Real-Time End-To-End Tasks
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A utility-based downlink radio resource allocation for multiservice cellular DS-CDMA networks
EURASIP Journal on Wireless Communications and Networking
Video personalization in resource-constrained multimedia environments
Proceedings of the 15th international conference on Multimedia
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem
The Journal of Supercomputing
Combining global optimization with local selection for efficient QoS-aware service composition
Proceedings of the 18th international conference on World wide web
A Fast Heuristic Algorithm for the Composite Web Service Selection
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Client-centered multimedia content adaptation
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Downlink resource allocation for autonomous infrastructure-based multihop cellular networks
EURASIP Journal on Advances in Signal Processing
Selecting highly optimal architectural feature sets with Filtered Cartesian Flattening
Journal of Systems and Software
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Automatic dynamic resource management architecture in tactical network environments
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A distributed heuristic solution using arbitration for the MMMKP
AusPDC '10 Proceedings of the Eighth Australasian Symposium on Parallel and Distributed Computing - Volume 107
Development of core to solve the multidimensional multiple-choice knapsack problem
Computers and Industrial Engineering
Fast multidimension multichoice knapsack heuristic for MP-SoC runtime management
ACM Transactions on Embedded Computing Systems (TECS)
A novel heuristic algorithm for QoS-aware end-to-end service composition
Computer Communications
Journal of Systems and Software
Information Sciences: an International Journal
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Global and local qos guarantee in web service selection
BPM'05 Proceedings of the Third international conference on Business Process Management
A hybrid approach for efficient Web service composition with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Vector bin packing with multiple-choice
Discrete Applied Mathematics
First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
International Journal of Metaheuristics
An efficient and reliable approach for quality-of-service-aware service composition
Information Sciences: an International Journal
| Hi-index | 0.00 |
The Multiple-Choice Multi-Dimension Knapsack Problem (MMKP) is a variant of the 0-1 Knapsack Problem, an NP-Hard problem. Hence algorithms for finding the exact solution of MMKP are not suitable for application in real time decision-making applications, like quality adaptation and admission control of an interactive multimedia system. This paper presents two new heuristic algorithms, M-HEU and I-HEU for solving MMKP. Experimental results suggest that M-HEU finds 96% optimal solutions on average with much reduced computational complexity and performs favorably relative to other heuristic algorithms for MMKP. The scalability property of I-HEU makes this heuristic a strong candidate for use in real time applications.