Zobrazeno 1 - 10
of 145
pro vyhledávání: '"Özdamar, L"'
Autor:
Özdamar, L, Barbarosoğlu, G
Publikováno v:
The Journal of the Operational Research Society, 1999 Aug 01. 50(8), 810-825.
Externí odkaz:
https://www.jstor.org/stable/3010340
Publikováno v:
International Journal of Production Research. Sep96, Vol. 34 Issue 9, p2613. 16p.
Autor:
Ulusoy, G., Özdamar, L.
Publikováno v:
International Journal of Production Research. Mar1994, Vol. 32 Issue 3, p693. 13p.
Autor:
Özdamar, L., Ertem, M.A.
We present a survey that focuses on the response and recovery planning phases of the disaster lifecycle. Related mathematical models developed in this area of research are classified in terms of vehicle/network representation structures and their fun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10007::57cbb1d15a67b7d49945c787ce0601e2
https://hdl.handle.net/20.500.11831/865
https://hdl.handle.net/20.500.11831/865
Publikováno v:
In Computers, Environment and Urban Systems 1999 23(5):399-422
Autor:
Özdamar, L., Pedamallu, C.S.
We propose a Population based dual-sequence Non-Penalty Annealing algorithm (PNPA) for solving the general nonlinear constrained optimization problem. The PNPA maintains a population of solutions that are intermixed by crossover to supply a new start
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10007::a7d4374deeb450d229265959693b0c2b
https://hdl.handle.net/20.500.11831/1847
https://hdl.handle.net/20.500.11831/1847
Autor:
Özdamar, L., Pedamallu, C.S.
In this study, a general solution methodology is presented for continuous constraint satisfaction problems. The performance of the method is demonstrated on challenging kinematics problems where the goal is to identify all real solutions. The develop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10007::8b7aab7311580e2108e15db62e9c0cbc
https://hdl.handle.net/20.500.11831/2700
https://hdl.handle.net/20.500.11831/2700
Autor:
Onbaşioglu, E., Özdamar, L.
In this study, a global optimization meta-heuristic is developed for the problem of determining the optimum data distribution and degree of parallelism in parallelizing a sequential program for distributed memory machines. The parallel program is con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10007::1e9c1118045d365d0734afb11db6846b
https://hdl.handle.net/20.500.11831/359
https://hdl.handle.net/20.500.11831/359
The capacitated lot sizing problem with overtime and setup times (CLSPOS) consists of planning the lot sizes of multiple families over a planning horizon with the objective of minimizing overtime and inventory holding costs. Each time that an item's
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10007::5bdfe24c001a24446a81637f6175a209
https://hdl.handle.net/20.500.11831/197
https://hdl.handle.net/20.500.11831/197
Autor:
Onbaşoglu, E., Özdamar, L.
Global optimization involves the difficult task of the identification of global extremities of mathematical functions. Such problems are often encountered in practice in various fields, e.g., molecular biology, physics, industrial chemistry. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_____10007::ce70aa84d1c0ffe95086fcc7da491a5d
https://hdl.handle.net/20.500.11831/336
https://hdl.handle.net/20.500.11831/336