Serinken, Asli

Profile Picture
Profile URL
https://gcris.yasar.edu.tr/handle/123456789/13128
Name Variants
Job Title
Dr.Öğr.Üyesi
Email Address
Main Affiliation
01.01.13.05. Bilgisayar Programcılığı Programı
Status
Current Staff
Website
ORCID ID
0000-0003-2633-5792
Scopus Author ID
55180262600
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
Scopus data could not be loaded because of an error. Please refresh the page or try again later.
This researcher does not have a WoS ID.
Scholarly Output

6

Articles

3

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

16

Scopus Citation Count

38

Patents

0

Projects

0

WoS Citations per Publication

2.67

Scopus Citations per Publication

6.33

Open Access Source

2

Supervised Theses

0

JournalCount
2012 4th International Conference on Problems of Cybernetics and Informatics PCI 20121
24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector MEC EurOPT 20101
3rd International Conference on Computational Science Engineering and Information Technology CCSEIT 20131
Mathematical and Computational Applications1
Optimization1
Current Page: 1 / 2

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Filters

2010 - 20196
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 6 of 6
  • Thumbnail Image
    Article
    Citation - WoS: 15
    Citation - Scopus: 23
    One-dimensional cutting stock problem with divisible items: A case study in steel industry
    (Isik University, 2019) Deniz Tanir; Onur Uǧurlu; Asli Guler; Urfat Nuriyev; Ugurlu, O.; Tanır, D.; Nurıyev, U.; Guler, A.
    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 then they can be recombined by welding. The objective is to minimize both the trim loss and the number of the welds. The problem can be seen as a natural generalization of the cutting stock problem (CSP) with skiving option [1] where recombining operation has a cost. In this paper a mathematical model for the problem is given and a dynamic programming based heuristic algorithm is proposed in accordance with the company needs. Furthermore a software which is based on the proposed heuristic algorithm is developed to use in MKA Company and its performance is analyzed by solving real-life problems in the steel industry. The computational experiments show the efficiency of the proposed algorithm. © 2021 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Mathematical computer games based on modular arithmetic
    (IEEE, 2012) Fidan Nuriyeva; Asli Guler; Deniz Tanir; Guler, Asli; Tanir, Deniz; Nuriyeva, Fidan
    In this paper computer aided games which motivate and bring out the mathematical abilities of students have been studied by inspiring 'Bachet's Game'. The winning strategies of the games are based on modular arithmetic. Winning algorithms and mathematical models are included in the paper. Levels of the logical and math games which have been proved to be beneficial for students in order to gain ability of appropriate selection and application of analytical technics and strategies in terms of problems could be applied in compliance with age group of students and be permanent during the academic life of the student as a result of its character. © 2012 IEEE. © 2013 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Complementary Problems for Subset-Sum and Change Making Problems
    (Springer Verlag service@springer.de, 2013) Asli Guler; Urfat Nuriyev; Guler, Asli; Nuriyev, Urfat
    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 used in computer science as well. CMP and SSP are NP-hard problems and these problems can be seen as types of the knapsack problem in some ways. The complementary problems for the change making problem and the subsetsum problem are defined in this study and it is aimed to examine the CMP and SSP by means of the complementary problems. © 2015 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - Scopus: 10
    A genetic algorithm to solve the multidimensional Knapsack problem
    (Association for Scientific Research membranes@mdpi.com, 2013) Murat Erşen Berberler; Asli Guler; Urfat Nuriyev; Berberler, Murat Ersen; Guler, Asli; Nuriyev, Urfat G.
    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 initial population is not randomly generated in the proposed algorithm thus the solution space is scanned more efficiently. Moreover the algorithm is written in C programming language and is tested on randomly generated instances. It is seen that the algorithm yields optimal solutions for all instances. © 2020 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 1
    Citation - Scopus: 3
    Algorithms with guarantee value for knapsack problems
    (Taylor & Francis Ltd, 2012) Asli Guler; Urfat Nuriyev; Murat Erşen Berberler; Fidan Nuriyeva; Berberler, Murat Ersen; Nuriyev, Urfat G.; Guler, Asli; Nuriyeva, Fidan
    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 are calculated in order to determine how the results returned by the algorithms are close to optimal solutions. Furthermore complementary problems for integer maximization KP and bounded integer maximization KP are defined, and it is aimed to improve the guarantee values which have been calculated before in terms of the complementary problems. © 2012 Copyright Taylor and Francis Group LLC. © 2012 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    Algorithms with guarantee value for Bounded Knapsack Problems
    (Vilnius Gediminas Technical University, 2010) Asli Guler; Fidan Nuriyeva; Guler, Asli; Nuriyeva, Fidan
    In this study one-dimensional Knapsack Problems which have many applications in economic area have been studied, then greedy algorithms have been discussed for these problems. Guarantee values of the algorithms have been calculated in order to determine how close the results returned by the algorithms are to optimal solutions. Furthermore complementary problem for Bounded Integer Maximization Knapsack Problem has been defined, and it has been aimed to improve the guarantee value calculated earlier in terms of the complementary problem. © Izmir University of Economics Turkey 2010. © 2014 Elsevier B.V. All rights reserved.