Introduction to algorithms
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
The zero/one multiple knapsack problem and genetic algorithms
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
On Quality of Service Optimization with Discrete QoS Options
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
Quality adaptation in a multisession multimedia system: model, algorithms, and architecture
The distributed utility model applied to optimal admission control and qos adaptation in multimedia systems and enterprise networks
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem
The Journal of Supercomputing
SPaC: a symbolic pareto calculator
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Efficient top-k processing over query-dependent functions
Proceedings of the VLDB Endowment
Resource Planning Heuristics for Service-Oriented Workflows
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Hard multidimensional multiple choice knapsack problems, an empirical study
Computers and Operations Research
Selecting highly optimal architectural feature sets with Filtered Cartesian Flattening
Journal of Systems and Software
Proceedings of the 46th Annual Design Automation Conference
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Solving the multi-dimensional multi-choice Knapsack problem with the help of ants
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
A novel multi-population genetic algorithm for multiple-choice multidimensional knapsack problems
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
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 heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP)
Computers and Operations Research
Information Sciences: an International Journal
Computers and Operations Research
MVRC heuristic for solving the multi-choice multi-constraint knapsack problem
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Simulation based evaluation of dynamic resource allocation for adaptive multimedia services
Proceedings of the 7th International Conference on Network and Services Management
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A hybrid approach for efficient Web service composition with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Designing the context matching engine for evaluating and selecting context information sources
MRC'05 Proceedings of the Second international conference on Modeling and Retrieval of Context
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
A fast and scalable multidimensional multiple-choice knapsack heuristic
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
An efficient and reliable approach for quality-of-service-aware service composition
Information Sciences: an International Journal
Hi-index | 0.01 |
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0-1 Knapsack Problem. We apply a transformation technique to map the multidimensional resource consumption to single dimension. Convex hulls are constructed to reduce the search space to find the near-optimal solution of the MMKP. We present the computational complexity of solving the MMKP using this approach. A comparative analysis of different heuristics for solving the MMKP has been presented based on the experimental results.