Operation-based Greedy Algorithm for Discounted Knapsack Problem
- 3 December 2022
- book chapter
- Published by Springer Nature
- p. 646-660
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Group theory-based optimization algorithm for solving knapsack problemsKnowledge-Based Systems, 2021
- A survey on swarm intelligence approaches to feature selection in data miningSwarm and Evolutionary Computation, 2020
- A New Binary Particle Swarm Optimization Approach: Momentum and Dynamic Balance Between Exploration and ExploitationIEEE Transactions on Cybernetics, 2019
- Ring Theory-Based Evolutionary Algorithm and its application to D{0-1} KPApplied Soft Computing, 2019
- Discrete differential evolutions for the discounted {0-1} knapsack problemInternational Journal of Bio-Inspired Computation, 2017
- Exact and approximate algorithms for discounted {0-1} knapsack problemInformation Sciences, 2016
- Wilcoxon Rank Sum Test2013
- The original Borda count and partial votingSocial Choice and Welfare, 2011
- Discrete-Variable Extremum ProblemsOperations Research, 1957
- On the Partition of NumbersProceedings of the London Mathematical Society, 1896