@article{article_469475, title={COMPARISON OF CLASSIC AND GREEDY HEURISTIC ALGORITHM RESULTS IN INTEGER PROGRAMMING: KNAPSACK PROBLEMS}, journal={Mugla Journal of Science and Technology}, volume={5}, pages={34–42}, year={2019}, DOI={10.22531/muglajsci.469475}, author={Durmuş, Burcu and İşçi Güneri, Öznur and İncekırık, Aynur}, keywords={Integer Programming,Classic Algorithms,Greedy Algorithm,Knapsack Problems}, abstract={<p class="Abstract"> <span lang="en-us" style="font-size:12pt;" xml:lang="en-us"> <i> <span style="font-size:10px;">This study
is designed to investigate the comparison of Greedy and classic algorithm
solution results and the results of solution algorithms for integer linear
programming (ILP) problems. The purpose of the study is to examine the
heuristic Greedy algorithm that solves the ILP problems and to reveal the differences
and similarities between the classic and heuristic Greedy algorithms on the
application. </span> </i> </span> </p> <p> <i> </i> </p> <i> </i> <p> <span style="font-size:10px;"> </span> <i> <span style="font-size:10px;font-family:Cambria, serif;">For this purpose, a software (JAVA Program)
which solves Knapsack Problems (KP) with Greedy terminology has been developed
and problems in different models have been solved with objective function and
constraints. The problems are solved by both the conventional classic algorithm
and the Greedy algorithm and the solution results are compared. </span> <span style="font-size:10px;font-family:’Times New Roman’, serif;"> </span> <span style="font-size:10px;font-family:Cambria, serif;">In the
study, the results of pure and (0-1) binary backpack problems were found to be
the same as those of heuristic algorithms for small problems. In addition, the
developed program solves single and two-dimensional KP in the literature. </span> </i> <br /> </p>}, number={1}, publisher={Mugla Sitki Kocman University}