A New Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problem

The International Conference on Electrical Engineering
doi 10.21608/iceeng.2010.33055
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Egypts Presidential Specialized Council for Education and Scientific Research

Related search

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

International Journal of Operations Research and Information Systems
2015English

Heuristic Solutions for the Multiple-Choice Multi-Dimension Knapsack Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Proposal of Adjustment Type Genetic Algorithm for Knapsack Problem

IEEJ Transactions on Electronics, Information and Systems
Electronic EngineeringElectrical
2004English

The Core Concept for the Multidimensional Knapsack Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Multi-Criteria Approach to Approximate Solution of Multiple-Choice Knapsack Problem

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2018English

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem

Journal of Korean Institute of Intelligent Systems
2010English

Local Search Heuristic for Multiple Knapsack Problem

International Journal of Intelligent Information Systems
2015English

Applying Multiple Multidimensional Knapsack Problem to Dynamic Load Balancing in Distributed Exascale Computing Environment

Azerbaijan Journal of High Performance Computing
2018English

Memetic Search for the Generalized Quadratic Multiple Knapsack Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy