Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Yüceer, Ümit

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/8977
Name Variants
Yüceer, Ü.
Yuceer, Umit
Job Title
Prof. Dr.
Email Address
Main Affiliation
06.04. Endüstri Mühendisliği
Endüstri Mühendisliği
06. Mühendislik Fakültesi
01. Çankaya Üniversitesi
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

5

Articles

4

Views / Downloads

983/135

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

12

Scopus Citation Count

20

WoS h-index

2

Scopus h-index

2

Patents

0

Projects

0

WoS Citations per Publication

2.40

Scopus Citations per Publication

4.00

Open Access Source

1

Supervised Theses

0

Google Analytics Visitor Traffic

JournalCount
Computers & Industrial Engineering1
Generalized Convexity And Related Topics1
International Mathematical Forum1
İstatistik Araştırma Dergisi1
Lecture Notes in Economics and Mathematical Systems1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2005 - 20105
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    Article
    An approach to discrete convexity and its use in an optimal fleet mix problem
    (Springer-Verlag Berlin, 2006) Cambini, Riccardo; Riccardi, Rossana; Yüceer, Ümit
    A notion of convexity for discrete functions is first introduced, with the aim to guarantee both the increasing monotonicity of marginal increments and the convexity of the sum of convex functions. Global optimality of local minima is then studied both for single variable functions and for multi variables ones. Finally, a concrete optimal fleet mix problem is studied, pointing out its discrete convexity properties.
  • Thumbnail Image
    Article
    Citation - WoS: 10
    Citation - Scopus: 18
    A Truck Loading Problem
    (Pergamon-elsevier Science Ltd, 2010) Ozakca, Arif; Yuceer, Umit
    A vehicle with m compartments transports q different products of various sizes from a source to n different destinations. The operational problem is how to load the compartments of the vehicle so that the replenishment time is maximized for a given route of destinations. A mixed integer linear programming model is developed for this class of problems. An investigation of the structure of the model reveals that a subproblem can be obtained in the form of a weighted distribution problem. Consequently, a simple subalgorithm finds an integer solution to this subproblem. The main algorithm bisects the interval of uncertainty until it becomes sufficiently small. There is another subalgorithm to test whether a feasible solution exists in the final interval of uncertainty by solving a Phase I problem. Our numerical experience has shown its computational efficiency and the quality of the solutions obtained. A problem of size 30 can be solved by this method in a fraction of a second. Further, an optimal solution is obtained in 82% of the randomly chosen problems. (C) 2010 Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    Article
    The equivalence of discrete convexity and the classical definition of convexity
    (2006) Yüceer, Ümit
    This article presents a proof of the fact that the classical definition of convexity of nondecreasing (increasing) first forward differences for discrete univariate functions is actually a special case of the concept of discrete convexity for functions defined on a discrete space. Consequently proving the discrete convexity of separable functions is simplified and becomes simply showing each univariate function is convex in the classical sense. An illustrative example is provided.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    An Approach To Discrete Convexity and Its Use in an Optimal Fleet Mix Problem
    (Springer-verlag Berlin, 2007) Cambini, R.; Riccardi, R.; Yüceer, Ü.
    A notion of convexity for discrete functions is first introduced, with the aim to guarantee both the increasing monotonicity of marginal increments and the convexity of the sum of convex functions. Global optimality of local minima is then studied both for single variable functions and for multi variables ones. Finally, a concrete optimal fleet mix problem is studied, pointing out its discrete convexity properties. © 2006 Springer-Verlag Berlin Heidelberg.
  • Thumbnail Image
    Article
    Marjinal Analiz Yoluyla Güvenilirlik Optimizasyonu
    (2005) Yüceer, Ümit
    Marjinal analizin güvenilirlik redandansı optimizasyonuna bir uyarlaması anlatılmaktadır. Amaç fonksiyonu ayrışık hale dönüştürülüp, konkav olduğu gösterilecek ve marjinal analiz metodunun çok seri ve hızlı bir şekilde, optimal olmasa bile, optimala çok yakın çözümler ürettiği bir örnekle gösterilecektir.