Visualization and analysis of the exact algorithm for knapsack problem based on exhaustive search

Article Name:		VISUALIZATION AND ANALYSIS OF THE EXACT ALGORITHM FOR KNAPSACK PROBLEM BASED ON EXHAUSTIVE SEARCH
Authors:		M.A. Kupriyashin (Russian Federation), G.I. Borzunov (Russian Federation)
Address:		M.A. Kupriyashin kmickle@yandex.ru National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow, Russian Federation G.I. Borzunov parproc@gmail.com National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow, Russian Federation
Abstract:		Knapsack packing vector testing procedures for the parallel exhaustive search algorithm have been analyzed. Graphs of computational complexity to test a single knapsack vector have been obtained via experiment for different values of knapsack element sizes. Diagrams of load balancing have been obtained and analyzed for the case when lexicographic sequence is split into equal-length segments.
Language:		English

Scientific Visualization