Single-row routing by simulated annealing

Download

015471.pdf

Date

1991

Author

Gülöksüz, Aslı

Metadata

Show full item record

Item Usage Stats

101
views

0
downloads

URI

https://hdl.handle.net/11511/8532

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Single Image Noise Level Estimation Using Dark Channel Prior Yeşilyurt, Aziz Berkay; Erol, Aybüke; Kamışlı, Fatih; Alatan, Abdullah Aydın (2019-09-22) Noise level is required as an input parameter in various image processing applications. In this work, we use the dark channel prior (DCP) to estimate the noise level of an image degraded by additive white Gaussian noise. We develop an approximate model of the probability density function of the dark channel of the noisy image. Using this model, the noise level is determined with the maximum likelihood estimation method from the dark channel intensity values of the noisy image. The results show that our meth...
Single machine scheduling with preventive maintenances Batun, Sakine; Azizoğlu, Meral (Informa UK Limited, 2009-01-01) We consider the single machine total flow time problem in which the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a branch-and-bound algorithm that employs powerful optimality properties and bounding procedures. Our extensive computational studies show that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with min...
Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
Single-molecule-resolution ultrafast near-field optical microscopy via plasmon lifetime extension Ovalı, Rasim Volga ; Şahin, Ramazan; Bek, Alpan; Taşgın, Mehmet Emre (2021-06-14) Metal nanostructures support plasmon oscillations on their surfaces, which normally decay very quickly. Nevertheless, the lifetime of these oscillations can be extended near a longer lifetime particle, e.g., a molecule. We utilize this phenomenon for ultrahigh (single-molecule) resolution ultrafast apertureless (scattering) applications. We demonstrate the phenomenon with the numerical solutions of 3D Maxwell equations. We use a nm-sized quantum emitter (QE) for the long lifetime particle. We place the QE a...
Single vector leptoquark production in e(+)e(-) and gamma e colliders Alıyev, Tahmasıb; Pak, NK (1996-10-01) We consider the single vector leptoquark (LQ) production at e(+)e(-) and gamma e colliders for two values of the center-of-mass energy root s = 500 GeV and root s = 1090 GeV, in a model-independent framework. We find that the cross sections for the single gauge and nongauge vector LQ productions are almost equal. The discovery limit for a single vector LQ production is obtained for both cases. It is shown that in e(+)e(-) collisions the single vector LQ production is more favorable than the vector LQ pair p...

Citation Formats

A. Gülöksüz, “Single-row routing by simulated annealing,” Middle East Technical University, 1991.