Local Search Heuristic for Multiple Knapsack Problem

International Journal of Intelligent Information Systems
doi 10.11648/j.ijiis.20150402.11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Science Publishing Group

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Memetic Search for the Generalized Quadratic Multiple Knapsack Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2016English

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem

Journal of Korean Institute of Intelligent Systems
2010English

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2015English

Tabu Search Heuristic for University Course Timetabling Problem

African Journal of Science and Technology
2010English

A New Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problem

The International Conference on Electrical Engineering
2010English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2005English

Development of an Interactive Tool Based on Combining Graph Heuristic With Local Search for Examination Timetable Problem

International Journal of Advanced Computer Science and Applications
Computer Science
2020English

Heuristic Cluster Algorithm for Multiple Facility Location-Allocation Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy