Meta-Heuristics Approach to Knapsack Problem in Memory Management

Asian Journal of Research in Computer Science
doi 10.9734/ajrcos/2019/v3i230087
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Sciencedomain International

Related search

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

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2018English

Bio-Inspired Population-Based Meta-Heuristics for Problem Solving

Natural Computing
Computer Science Applications
2017English

On the Robust Knapsack Problem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2013English

An Exact Approach for the 0–1 Knapsack Problem With Setups

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2017English

A Virtual Pegging Approach to the Max–min Optimization of the Bi-Criteria Knapsack Problem

International Journal of Computer Mathematics
Computational TheoryApplied MathematicsComputer Science ApplicationsMathematics
2009English

Applications of Meta-Heuristics to Traffic Engineering in IP Networks

International Transactions in Operational Research
ManagementBusinessInternational ManagementStrategyManagement ScienceComputer Science ApplicationsInnovationManagement of TechnologyOperations Research
2010English

Statistical Mechanics of the Knapsack Problem

Journal of Physics A: Mathematical and General
1994English

Stochastic Diffusion Binary Differential Evolution to Solve Multidimensional Knapsack Problem

International Journal of Machine Learning and Computing
ManagementComputer Science ApplicationsInformation SystemsArtificial Intelligence
2016English

Local Search Heuristic for Multiple Knapsack Problem

International Journal of Intelligent Information Systems
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy