Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem
DOI: http://dx.doi.org/10.30630/joiv.4.1.333
Abstract
Keywords
Full Text:
PDFReferences
Gossett, Eric. Discreet Mathematics with Proof. New Jersey: Pearson Education Inc., 2013.
Hristakeva, Maya and Dipti Shrestha. “Solving the 0/1 Knapsack Problem with Genetic Algorithms.” MICS 2014 Proceedings. .
S. Mohanty, R. Satapathy, “An evolutionary multiobjective genetic algorithm to solve 0/1 Knapsack Problem,” IEEE Transl.
Beijing, vol. 2, pp. 397–399, August 2009.P.KOLESAR, “A branch and bound algorithm for the knapsack problem. Manage,” Sci, pp. 723-735, May 2018.
Adams, E. Balas, D. Zawack. The Shifting Bottleneck Procedure for Job-Shop Scheduling. Management Science, 34, 3, 391–401, .2017.
Y. Yang, R.L. Bulfin. An exact algorithm for the Knapsack Problem with Setup. Int. J. Operational Research, 5, 280–291, 2018.
George B. Dantzig, Discrete-Variable Extremum Problems, Operations Research Vol. 5, No. 2, April 1957, pp. 266–288,doi:10.1287/opre.5.2.266.
Different Approaches to Solve the 0/1 Knapsack Problem. Maya Hristakeva, Dipti Shrestha; Simpson College.
Rahman K. and Ahmed S. Performance Analysis of Genetic Algorithm for Solving the Multiple-Choice Multi-Dimensional Knapsack Problem. International Journal of Recent Trends in Engineering, 2009, vol. 2, no. 2.2017.
Chen Lin, “A Heuristic Genetic Algorithm Based on Schema Replacement for 0-1 knapsack Problem”, Fourth International Conference on Genetic and Evolutionary Computing 2015
Harish G , A hybrid PSO – GA algorithm for constrained optimization problems Applied Mathematics and Computation (Atlanta, USA: Elsevier) 274 292 – 305,2016.
Cormen T H 2009 Introduction to algorithms (third edition) (MIT press).
Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610 (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id
View JOIV Stats
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.