A Shuffled Complex Evolution Algorithm For the Multidimensional Knapsack Problem
- 25 October 2015
- book chapter
- Published by Springer Nature
- p. 768-775
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A shuffled complex evolution algorithm with opposition-based learning for a permutation flow shop scheduling problemInternational Journal of Computer Integrated Manufacturing, 2014
- SCIP: solving constraint integer programsMathematical Programming Computation, 2009
- A modified shuffled frog-leaping optimization algorithm: applications to project managementStructure and Infrastructure Engineering, 2007
- A Genetic Algorithm for the Multidimensional Knapsack ProblemJournal of Heuristics, 1998
- An efficient preprocessing procedure for the multidimensional 0–1 knapsack problemDiscrete Applied Mathematics, 1994
- Effective and efficient global optimization for conceptual rainfall‐runoff modelsWater Resources Research, 1992
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack ProblemJournal of the Operational Research Society, 1979
- EDUCATIONDecision Sciences, 1973
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966