Author

Now showing items 1-7 of 7

    • A genetic algorithm to solve the multidimensional Knapsack problem 

      Berberler, M.E.; Guler, A.; Nuriyev, U.G. (Mathematical and Computational Applications, 2013)
      In this paper, The Multidimensional Knapsack Problem (MKP) which occurs in many different applications is studied and a genetic algorithm to solve the MKP is proposed. Unlike the technique of the classical genetic algorithm, ...

    • A New Genetic Algorithm For The 0-1 Knapsack Problem 

      Guler, A.; Berberler, M.E.; Nuriyev, U.G. (2016)
      In this paper, the 0-1 Knapsack Problem (KP) which occurs in many different applications is studied and a new genetic algorithm to solve the KP is proposed. In our methodology, n items are represented by n genes on a bit ...

    • Algorithms with guarantee value for knapsack problems 

      Guler, A.; Nuriyev, U.G.; Berberler, M.E.; Nuriyeva, F. (Optimization, 2012)
      In this study one-dimensional knapsack problems (KP), which have many applications in technical and economic areas, are studied; then greedy algorithms are discussed for these problems. Guarantee values of these algorithms ...

    • Algorithms with guarantee value for knapsack problems 

      Guler, A.; Nuriyev, U.G.; Berberler, M.E.; Nuriyeva, F. (TAYLOR & FRANCIS LTD, 2012)
      In this study one-dimensional knapsack problems (KP), which have many applications in technical and economic areas, are studied; then greedy algorithms are discussed for these problems. Guarantee values of these algorithms ...

    • Complementary Problems for Subset-Sum and Change Making Problems 

      Guler, A.; Nuriyev, U.G. (Advances in Intelligent Systems and Computing, 2013)
      In this study, Change Making Problem (CMP) and Subset-Sum Problem (SSP), which can arise, in practice, in some classes of one dimensional cargo loading and cutting stock problems, are researched. These problems are often ...

    • One-Dimensional Cutting Stock Problem With Divisible Items: A Case Study In Steel Industry 

      Tanir, D.; Ugurlu, O.; Guler, A.; Nuriyev, U.G. (2019)
      Abstract. This paper considers the one-dimensional cutting stock problem (1D-CSP) with divisible items, which arises in the steel industries. While planning the steel cutting operations, each item can be divided into ...

    • ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH DIVISIBLE ITEMS: A CASE STUDY IN STEEL INDUSTRY 

      Tanir, D.; Ugurlu, O.; Guler, A.; Nuriyev, U.G. (TURKIC WORLD MATHEMATICAL SOC, 2019)
      This paper considers the one-dimensional cutting stock problem (1D-CSP) with divisible items, which arises in the steel industries. While planning the steel cutting operations, each item can be divided into smaller pieces, ...