Yazar

Toplam kayıt 2, listelenen: 1-2

    • 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 ...

    • 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, ...