@article {1602, title = {Column generation-based prototype learning for optimizing area under the receiver operating characteristic curve}, journal = {European Journal of Operational Research}, volume = {314}, year = {2024}, pages = {297{\textendash}307}, author = {Erhan C Ozcan and Berk G{\"o}rg{\"u}l{\"u} and Mustafa Gokce Baydogan} } @inbook {1585, title = {Solution of a Real-Life Vehicle Routing Problem with Meal Breaks and Shifts}, booktitle = {Green Transportation and New Advances in Vehicle Routing Problems}, year = {2020}, pages = {131{\textendash}157}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, doi = {10.1007/978-3-030-45312-1_5}, url = {https://doi.org/10.1007/978-3-030-45312-1_5}, author = {Ci{\u g}dem Karademir and {\"U}mit Bilge and Necati Aras and G{\"o}kay Burak Akku{\c s} and G{\"o}ksu {\"O}znergiz and Onur Do{\u g}an} } @article {1456, title = {Statistical inference using stratified judgment post-stratified samples from finite populations}, journal = {Environmental and Ecological Statistics}, volume = {27}, year = {2020}, pages = {73{\textendash}94}, author = {Ozturk, Omer and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {1439, title = {Assignment problem with conflicts}, journal = {Computers \& Operations Research}, volume = {111}, year = {2019}, pages = {214-229}, abstract = {

We focus on an extension of the assignment problem with additional conflict (pair) constraints in conjunction with the assignment constraints and binary restrictions. Given a bipartite graph with a cost associated with each edge and a conflict set of edge pairs, the assignment problem with conflict constraints corresponds to finding a minimum weight perfect matching without any conflicting edge pair. For example, some chemicals cannot be processed on close processors, food and toxic products cannot be stored neighboring locations at the same storage area, and machines cannot be sent to process jobs without satisfying some spatial constraints. Unlike the well-known assignment problem, this problem is NP-hard. We first introduce a realistic special class and demonstrate its polynomial solvability. Then, we propose a Branch-and-Bound algorithm and a Russian Doll Search algorithm using the assignment problem relaxations for lower bound computations, and introduce combinatorial branching rules based on the conflicting edges in an optimal solution of the relaxations. According to the extensive computational experiments we can say that the proposed algorithms are very efficient.

}, keywords = {Assignment problem, Branch-and-bound, Conflicts, integer programming}, issn = {0305-0548}, doi = {https://doi.org/10.1016/j.cor.2019.07.001}, url = {https://www.sciencedirect.com/science/article/pii/S0305054819301777}, author = {Temel {\"O}ncan and Zeynep {\c S}uvak and M. Hakan Aky{\"u}z and I. Kuban Altinel} } @article {1440, title = {Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem}, journal = {Annals of Operations Research}, volume = {279}, year = {2019}, pages = {1{\textendash}42}, author = {Aky{\"u}z, M Hakan and {\"O}ncan, Temel and I. Kuban Altinel} } @article {1433, title = {A column generation heuristic for {VMAT} planning with adaptive {CVaR} constraints}, journal = {Physics in Medicine {\&} Biology}, volume = {64}, year = {2019}, month = {oct}, pages = {205024}, abstract = {

In this study we develop an efficient computational procedure that generates medically acceptable treatment plans for volumetric modulated arc therapy with constant gantry speed. Our proposed method is a column generation heuristic based on a mixed integer linear programming model, where the objective function contains minimization of total monitor unit of the treatment plan and dose-volume requirements are included as conditional value-at-risk constraints. Our heuristic generates a full treatment arc for the restricted master problem and calibrates the right hand side parameters of the conditional value-at-risk constraints in the first phase. In the second phase, this initial solution is improved by performing column generation. This is a fully automated procedure and produces treatment plans in a single call without any human intervention. We evaluate its performance on real prostate cancer data by comparing the quality of the generated plans with those obtained by a widely used commercial treatment planning system. Our analysis shows that the results are promising, and the generated plans satisfy the prescription restrictions and require fewer monitor units on average compared to the ones obtained using Eclipse.

}, doi = {10.1088/1361-6560/ab416e}, url = {https://doi.org/10.1088/1361-6560/ab416e}, author = {P{\i}nar Dursun and Z C Ta{\c s}k{\i}n and I. Kuban Altinel and Hatice Bilge and Nazmiye D{\"o}nmez Kesen and Murat Okutan and Ethem Nezih Oral} } @article {1445, title = {SLA-aware optimal resource allocation for service-oriented networks}, journal = {Future Generation Computer Systems}, volume = {101}, year = {2019}, pages = {959-974}, abstract = {

The popularity of traditional network services and web content is succeeded by the recent trend in customized services proliferated by the smart devices and gadgets. Fall-risk assessment, augmented reality, ECG (electrocardiography) monitoring, virtual reality-based gaming and similar services are driven through data generated by multi-modal sensors embedded in the end-user equipment. These services may possess varying characteristics and requirements represented with performance metrics and Quality of Service (QoS) parameters. Even though the small form-factor end-user gadgets are getting powerful in terms of resource capacity, they are still incapable of executing complex routines, and thus these tasks should be offloaded to a remote machine. Service-Centric Networks (SCN) focus on delivering customized services to the users in a location-independent fashion. This is in parallel with previous vision put forward by the Information-Centric Networks (ICN) and Content Delivery Networks (CDN), which aim to enhance the end-user experience. The novel set of services for complementing the daily activities of the end-users mostly depicts a latency-intolerant attribute which ultimately calls for a full-fledged resource allocation scheme. Within this context, both computation and networking resources should be allocated optimally, and task assignments should be handled precisely for following the requirements specified by the Service Level Agreements (SLAs). This paper initially presents and discusses problem definitions that should be addressed by the service-centric multi-tier computing architecture that is composed of edge, metro, and cloud servers. In order to achieve this objective, an SLA-aware optimal resource allocation and task assignment model for service-oriented networks is proposed. This optimization model is based on a nonlinear delay formulation for accommodating service-centric network scenarios under various conditions. It is then reshaped as a mixed-integer linear model through piecewise linear approximation. Additionally, a heuristic implementation is presented to address the time and space complexities of the problem for which the aforementioned optimization models remain ineffective. Performance evaluation results show that the proposed solutions are able to find a good allocation of resources while taking the requirements of the services into account.

}, keywords = {Cloud computing, Edge computing, Network optimization, Service-centric networks, Task offloading}, issn = {0167-739X}, doi = {https://doi.org/10.1016/j.future.2019.07.050}, url = {https://www.sciencedirect.com/science/article/pii/S0167739X19306430}, author = {Ahmet Cihat Bakt{\i}r and Bet{\"u}l Ahat and Necati Aras and Atay {\"O}zg{\"o}vde and Cem Ersoy} } @article {1457, title = {Model based inference using ranked set samples}, journal = {Survey Methodology}, volume = {44}, year = {2018}, month = {Jun}, pages = {1{\textendash}16}, issn = {0714-0045}, author = {Ozturk, Omer and K{\"o}n{\"u}l Bayramo{\u g}lu Kavlak} } @article {1450, title = {Queuing systems in a feedback environment: Continuous versus discrete-event simulation}, journal = {Journal of Simulation}, volume = {12}, year = {2018}, pages = {144-161}, abstract = {

AbstractThe discrete stochastic nature of typical queuing problems calls for discrete-event simulation, rather than continuous simulation that would ignore the discrete details that may be important in queuing dynamics. However, continuous simulation can perhaps be suitable for certain large queuing systems that involve feedback interactions and time delays. This study examines this question by a series of simulation experiments with queuing systems. We start with an M/M/2 system with state-dependent arrivals. Since continuous simulation represents the system states by continuous variables, when these variables (number of entities) revolve around small integer values, discrete and continuous simulation approaches exhibit significant differences in their output dynamics. However, when the system scale is increased (many servers, many entities), errors caused by continuity assumption drop significantly and the two simulation approaches yield much closer outputs. Finally, when a delay is introduced before the state of the system influences the arrival rates, the system behaviour becomes oscillatory, involving even sustained oscillations when the delay is discrete. We show that in such settings, continuous simulation can be superior to discrete simulation, since the system exhibits far-from-equilibrium dynamics driven by the endogenous system structure, rather than by discrete stochastic events. Our results have various real-life modelling implications.

}, doi = {10.1080/17477778.2018.1465153}, url = {https://doi.org/10.1080/17477778.2018.1465153}, author = {Yaman Barlas and Onur {\"O}zg{\"u}n} } @article {1166, title = {Karbon Vergisi ile Sera Gaz{\i} Emisyonlar{\i}n{\i}n Azalt{\i}m{\i}: Turkiye Vakas{\i}.}, journal = {International Relations/Uluslararasi Iliskiler}, volume = {14}, year = {2017}, author = {G{\"u}rkan Kumbaro{\u g}lu and {\.I}lhan Or and I{\c S}IK, Mine} } @article {1162, title = {Mispricing in Option Pricing Models Versus Market Payoffs: An Efficiency-Based Performance Metric}, journal = {Wilmott}, volume = {2017}, year = {2017}, pages = {44{\textendash}57}, author = {Orbay, Berk and Refik G{\"u}ll{\"u} and Wolfgang H{\"o}rmann} } @article {1452, title = {Performance analysis of an aggregation and disaggregation solution procedure to obtain a maintenance plan for a partially observable multi-component system}, journal = {Reliability Engineering \& System Safety}, volume = {167}, year = {2017}, pages = {652-662}, abstract = {

We analyze the performance of an aggregation and disaggregation procedure in giving the optimal maintenance decisions for a multi-component system under partial observations in a finite horizon. The components deteriorate in time and their states are hidden to the decision maker. Nevertheless, it is possible to observe signals about the system status and to replace components in each period. The aim is to find a cost effective replacement plan for the components in a given time horizon. The problem is formulated as a partially observable Markov decision process (POMDP). We aggregate states and actions in order to reduce the problem space and obtain an optimal aggregate policy which we disaggregate by simulating it using dynamic Bayesian networks (DBN). The procedure is statistically compared to an approximate POMDP solver that uses the full state space information. Cases where aggregation performs relatively better are isolated and it is shown that k-out-of-n systems belong to this class.

}, keywords = {Aggregation, Disaggregation, Dynamic Bayesian networks, Maintenance, Multi-component systems, Partially observable Markov decision processes}, issn = {0951-8320}, doi = {https://doi.org/10.1016/j.ress.2017.04.013}, url = {https://www.sciencedirect.com/science/article/pii/S095183201730443X}, author = {Demet {\"O}zg{\"u}r-{\"U}nl{\"u}ak{\i}n and Taner Bilgi{\c c}} } @article {._zba__2014, title = {Modeling and Simulation of the Endogenous Dynamics of Housing Market Cycles}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {17}, number = {1}, year = {2014}, pages = {19}, abstract = {

The purpose of this study is to model and analyze by simulation the dynamics of endogenously created oscillations in real estate (housing) prices. A system dynamics simulation model is built to understand some of the structural sources of cycles in the key housing market variables, from the perspective of construction companies. The model focuses on the economic balance dynamics between supply and demand. Because of the unavoidable delays in the perception of the real estate market conditions and construction of new buildings, prices and related market variables exhibit strong oscillations. Two policies are tested to reduce the oscillations: decreasing the construction time, and taking into account the houses under construction in starting new projects. Both policies yield significantly reduced oscillations, more stable behaviors.

}, keywords = {Housing Cycles, Price Oscillations, Real Estate Modeling, Socio-Economic Simulation, System Dynamics}, issn = {1460-7425}, url = {http://jasss.soc.surrey.ac.uk/17/1/19.html}, author = {Birnur {\"O}zba{\c s} and Onur {\"O}zg{\"u}n and Yaman Barlas} } @article {ozgur2014replacement, title = {Replacement policies for a complex system with unobservable components using dynamic Bayesian networks}, journal = {International Journal of Computational Intelligence Systems}, volume = {7}, number = {sup1}, year = {2014}, pages = {68{\textendash}83}, publisher = {Taylor \& Francis}, author = {{\"O}zg{\"u}r-{\"U}nl{\"u}akin, Demet and Taner Bilgi{\c c}} } @article {ekcsiouglu2014save, title = {Save the Musicians! The Ergonomics of the Drumming}, journal = {Advances in Physical Ergonomics and Human Factors: Part II}, volume = {15}, year = {2014}, pages = {269}, publisher = {AHFE Conference}, author = {Mahmut Ek{\c s}io{\u g}lu and {\"O}zt{\"u}rk, N Kaan and {\c S}irin, Orkun} } @proceedings {nisa1, title = {Evaluation of Alternative Dynamic Behavior Representations for Automated Model Output Classification and Clustering}, journal = {31st International Conference of the System Dynamics Society}, year = {2013}, author = {Nisa {\"O}nsel and E. {\"O}nsel and G{\"o}nen{\c c} Y{\"u}cel} } @proceedings {nisa2, title = {Modeling the Dynamics of Methylmercury Biomagnification}, journal = {31st International Conference of the System Dynamics Society}, year = {2013}, author = {Bacaks{\i}zlar, N. G. and Nisa {\"O}nsel} } @article {1470, title = {On the quality variation impact of returns in remanufacturing}, journal = {Computers \& Industrial Engineering}, volume = {64}, year = {2013}, month = {Apr}, pages = {929{\textendash}936}, issn = {03608352}, author = {Aybek Korugan and Dinge{\c c}, Kemal Din{\c c}er and {\"O}nen, Tolga and Ate{\c s}, N{\"u}fer Y} } @proceedings {ozgun, title = {Effects of Delay, Nonlinearity and Feedback on the Overall Complexity of a Stock Management Game}, journal = {30th International Conference of the System Dynamics Society}, year = {2012}, author = {Onur {\"O}zg{\"u}n and Yaman Barlas} } @article {1476, title = {Modeling and analysis of a decentralized electricity market: An integrated simulation/optimization approach}, journal = {Energy}, volume = {44}, year = {2012}, pages = {830-852}, abstract = {

In this study, a model is developed to investigate the implications of an hourly day-ahead competitive power market on generator profits, electricity prices, availability and supply security. An integrated simulation/optimization approach is employed integrating a multi-agent simulation model with two alternative optimization models. The simulation model represents interactions between power generator, system operator, power user and power transmitter agents while the network flow optimization model oversees and optimizes the electricity flows, dispatches generators based on two alternative approaches used in the modeling of the underlying transmission network: a linear minimum cost network flow model and a non-linear alternating current optimal power flow model. Supply, demand, transmission, capacity and other technological constraints are thereby enforced. The transmission network, on which the scenario analyses are carried out, includes 30 bus, 41 lines, 9 generators, and 21 power users. The scenarios examined in the analysis cover various settings of transmission line capacities/fees, and hourly learning algorithms. Results provide insight into key behavioral and structural aspects of a decentralized electricity market under network constraints and reveal the importance of using an AC network instead of a simplified linear network flow approach.

}, keywords = {Alternative current optimum power flow, Electricity market modeling and design, Minimum cost network flow, Multi-agent simulation}, issn = {0360-5442}, doi = {https://doi.org/10.1016/j.energy.2012.05.009}, url = {https://www.sciencedirect.com/science/article/pii/S036054421200388X}, author = {Kemal Sar{\i}ca and G{\"u}rkan Kumbaro{\u g}lu and {\.I}lhan Or} } @proceedings {ozgun, title = {Systemic Complexity of a Growth Management Game: Comparative Analysis of Decision Heuristics and Experimental Results}, journal = {30th International Conference of the System Dynamics Society}, year = {2012}, author = {Onur {\"O}zg{\"u}n and Yaman Barlas} } @inbook {ekcsiouglu2011heuristic, title = {Heuristic evaluation and usability testing: case study}, booktitle = {Internationalization, Design and Global Development}, year = {2011}, pages = {143{\textendash}151}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Mahmut Ek{\c s}io{\u g}lu and Kiris, Esin and \cCapar, Burak and Sel{\c c}uk, Murat N and Ouzeir, Selen} } @proceedings {nisa3, title = {Modeling the Dynamics of Academic Publications and Citations}, journal = {29th International Conference of the System Dynamics Society}, year = {2011}, author = {Nisa {\"O}nsel and Yaman Barlas} } @mastersthesis {nisa6, title = {Modeling the Dynamics of Academic Publications and Citations}, year = {2011}, school = {Bo{\u g}azi{\c c}i University}, type = {MS}, author = {Nisa {\"O}nsel} } @article {altinel2011variable, title = {Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {10}, year = {2011}, pages = {1813{\textendash}1826}, publisher = {Nature Publishing Group}, author = {I. Kuban Altinel and Necati Aras and {\"O}zk{\i}sac{\i}k, KC} } @article {1478, title = {What determines urban households{\textquoteright} willingness to pay for CO2 emission reductions in Turkey: A contingent valuation survey}, journal = {Energy Policy}, volume = {39}, year = {2011}, pages = {689-698}, abstract = {

This paper explores Turkish urban households{\textquoteright} willingness to pay (WTP) for CO2 emission reductions expected to result from improvements in power production. A face-to-face questionnaire, with a Contingent valuation (CV) module prepared using the double-bounded dichotomous choice elicitation framework, was administered to 2422 respondents representative of urban Turkey{\textemdash}a developing country with low but rapidly increasing greenhouse gas emissions. The determinants of WTP were identified by considering not only the impact of standard socio-economic factors but also the effects of environmental knowledge, attitudes and behaviour, the relevance of the identity of the collection agent (national versus international institutions) in terms of trust people have towards them, and the degree of perceived participation of others in the realization of the project. Our study confirms the existing literature in demonstrating that WTP figures reported by young and educated people that are active on environmental issues, and who also possess material security and environmental knowledge, are more likely to be high. However, their willingness to make contributions is hampered significantly by their belief that their fellow citizens will not contribute and the general lack of trust in institutions. Overall, this study may be taken as a call to eliminate governance-related uncertainties in climate change deals.

}, keywords = {Climate change, Contingent valuation, Turkey}, issn = {0301-4215}, doi = {https://doi.org/10.1016/j.enpol.2010.10.042}, url = {https://www.sciencedirect.com/science/article/pii/S0301421510007937}, author = {Fikret Adaman and Nihan Karal{\i} and G{\"u}rkan Kumbaro{\u g}lu and {\.I}lhan Or and Beg{\"u}m {\"O}zkaynak and {\"U}nal Zenginobuz} } @article {57723058, title = {{The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals}}, journal = {Iie Transactions}, volume = {42}, year = {2010}, pages = {825{\textendash}841}, doi = {10.1080/0740817X.2010.491504}, author = {M. Hakan Aky{\"u}z and Temel {\"O}ncan and I. Kuban Altinel} } @article {4756711, title = {{A comparative analysis of several asymmetric traveling salesman problem formulations}}, journal = {Computers \& Operations Research}, volume = {36}, year = {2009}, pages = {637{\textendash}654}, doi = {10.1016/j.cor.2007.11.008}, author = {Temel {\"O}ncan and I. Kuban Altinel and Gilbert Laporte} } @book {47738327, title = {{Efficient Lower and Upper Bounds for the Multi-commodity Capacitated Multi-facility Weber Problem with Rectilinear Distances}}, series = {Logistik Management}, year = {2009}, doi = {10.1007/978-3-7908-2362-2_11}, author = {M. Hakan Aky{\"u}z and Temel {\"O}ncan and I. Kuban Altinel} } @article {4778684, title = {{A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations}}, journal = {European Journal of Operational Research}, volume = {198}, year = {2009}, pages = {790{\textendash}799}, doi = {10.1016/j.ejor.2008.10.014}, author = {I. Kuban Altinel and Engin Durmaz and Necati Aras and Kerem Can {\"O}zkisacik} } @article {ozkisacik2009solving, title = {Solving probabilistic multi-facility Weber problem by vector quantization}, journal = {OR spectrum}, volume = {31}, number = {3}, year = {2009}, pages = {533{\textendash}554}, publisher = {Springer-Verlag}, author = {{\"O}zk{\i}sac{\i}k, Kerem Can and I. Kuban Altinel and Necati Aras} } @proceedings {nisa4, title = {A Dynamic Simulation Model of Academic Publications and Citations}, journal = {26th International Conference of the System Dynamics Society}, year = {2008}, author = {K{\"u}{\c c}{\"u}k, B. and Nisa {\"O}nsel and B. Eskici} } @article {oner2008economic, title = {Economic lot scheduling with uncontrolled co-production}, journal = {European Journal of Operational Research}, volume = {188}, number = {3}, year = {2008}, pages = {793{\textendash}810}, publisher = {Elsevier}, author = {{\"O}ner, Selma and Taner Bilgi{\c c}} } @article {aras2008efficient, title = {Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem}, journal = {Journal of the Operational Research Society}, volume = {59}, number = {1}, year = {2008}, pages = {64{\textendash}79}, publisher = {Nature Publishing Group}, author = {Necati Aras and Orbay, M and I. Kuban Altinel} } @article {4777890, title = {{Exact solution procedures for the balanced unidirectional cyclic layout problem}}, journal = {European Journal of Operational Research}, volume = {189}, year = {2008}, pages = {609{\textendash}623}, doi = {10.1016/j.ejor.2006.09.094}, author = {Temel {\"O}ncan and I. Kuban Altinel} } @article {FBE-IE-02-2008-02, title = {Measurement, Analysis and Evaluation of Academic Publications and Citations}, number = {FBE-IE-02/2008-02}, year = {2008}, institution = {Bo{\u g}azi{\c c}i University}, author = {Yaman Barlas and B. K{\"u}{\c c}{\"u}k and Nisa {\"O}nsel and A. S. Kocaman} } @article {4777558, title = {{Optimum component test plans for phased-mission systems}}, journal = {European Journal of Operational Research}, volume = {185}, year = {2008}, pages = {255{\textendash}265}, doi = {10.1016/j.ejor.2007.01.053}, author = {Orhan Feyzioglu and I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @article {aras2007new, title = {New heuristic methods for the capacitated multi-facility Weber problem}, journal = {Naval Research Logistics (NRL)}, volume = {54}, number = {1}, year = {2007}, pages = {21{\textendash}32}, publisher = {Wiley Online Library}, author = {Necati Aras and I. Kuban Altinel and Orbay, Metin} } @article {aksen2007open, title = {Open vehicle routing problem with driver nodes and time deadlines}, journal = {Journal of the Operational Research Society}, volume = {58}, number = {9}, year = {2007}, pages = {1223{\textendash}1234}, publisher = {Nature Publishing Group}, author = {Aksen, D and {\"O}zyurt, Z and Necati Aras} } @article {2526247, title = {{The design of optimum component test plans for system reliability}}, journal = {Computational Statistics \& Data Analysis}, volume = {50}, year = {2006}, pages = {3099{\textendash}3112}, doi = {10.1016/j.csda.2005.06.015}, author = {Orhan Feyzioglu and I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @article {bilge2006multi, title = {Multi-attribute responsive dispatching strategies for automated guided vehicles}, journal = {International Journal of Production Economics}, volume = {100}, number = {1}, year = {2006}, pages = {65{\textendash}75}, publisher = {Elsevier}, author = {{\"U}mit Bilge and Esenduran, G{\"o}k{\c c}e and Varol, Nebibe and {\"O}zt{\"u}rk, Zeynep and Ayd{\i}n, Burcu and Alp, Aysun} } @inbook {ozyurt2006open, title = {Open vehicle routing problem with time deadlines: Solution methods and an application}, booktitle = {Operations Research Proceedings 2005}, year = {2006}, pages = {73{\textendash}78}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {{\"O}zyurt, Zeynep and Aksen, Deniz and Necati Aras} } @article {aras2006solving, title = {Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps}, journal = {Journal of the Operational Research Society}, volume = {57}, number = {1}, year = {2006}, pages = {82{\textendash}93}, publisher = {Nature Publishing Group}, author = {Necati Aras and {\"O}zk{\i}sac{\i}k, KC and I. Kuban Altinel} } @article {1217349, title = {{A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE}}, journal = {IEEE Transactions on Neural Networks}, volume = {14}, year = {2003}, pages = {869{\textendash}890}, doi = {10.1109/TNN.2003.811562}, author = {Necati Aras and I. Kuban Altinel and John Oommen} } @conference {altmel2003self, title = {A self-organizing method for map reconstruction}, booktitle = {Neural Networks for Signal Processing, 2003. NNSP{\textquoteright}03. 2003 IEEE 13th Workshop on}, year = {2003}, pages = {677{\textendash}687}, publisher = {IEEE}, organization = {IEEE}, author = {I. Kuban Altinel and Necati Aras and Oommen, BJ} } @article {48044444, title = {{Dynamic component testing of a series system with redundant subsystems}}, journal = {Iie Transactions}, volume = {33}, year = {2001}, pages = {1093{\textendash}1108}, doi = {10.1023/A:1010922720237}, author = {I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @article {14553068, title = {{General continuous time models for production planning and scheduling of batch processing plants: mixed integer linear program formulations and computational issues}}, journal = {Computers \& Chemical Engineering}, volume = {25}, year = {2001}, pages = {371{\textendash}389}, doi = {10.1016/S0098-1354(00)00663-3}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @article {59469243, title = {{A general software testing model involving operational profiles}}, volume = {15}, year = {2001}, pages = {519{\textendash}533}, author = {S{\"u}leyman {\"O}zekici and I. Kuban Altinel and M. E. Angun} } @article {14462270, title = {{Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches}}, journal = {Computers \& Operations Research}, volume = {27}, year = {2000}, pages = {461{\textendash}494}, doi = {10.1016/S0305-0548(99)00065-9}, author = {I. Kuban Altinel and Necati Aras and John Oommen} } @conference {507696, title = {{A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE}}, booktitle = {European Conference on Artificial Intelligence}, year = {2000}, pages = {261{\textendash}265}, author = {Necati Aras and I. Kuban Altinel and John Oommen} } @conference {aras2000kohonen, title = {A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE.}, booktitle = {ECAI}, year = {2000}, pages = {261{\textendash}265}, author = {Necati Aras and I. Kuban Altinel and Oommen, B John} } @article {1740244, title = {{The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem}}, journal = {Neural Networks}, volume = {12}, year = {1999}, pages = {1273{\textendash}1284}, doi = {10.1016/S0893-6080(99)00063-5}, author = {Necati Aras and John Oommen and I. Kuban Altinel} } @article {14552649, title = {{Optimal planning and scheduling of batch plants with operational uncertainties: An industrial application to Baker{\textquoteright}s yeast production}}, journal = {Computers \& Chemical Engineering}, volume = {23}, year = {1999}, doi = {10.1016/S0098-1354(99)80045-3}, author = {Seza Or{\c c}un and T. Cebe and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @article {14552513, title = {{Reducing the integrality gap with a modified re-formulation linearization approach}}, journal = {Computers \& Chemical Engineering}, volume = {23}, year = {1999}, doi = {10.1016/S0098-1354(99)80133-1}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @inbook {oommen1999solving, title = {Solving the Travelling Salesman Problem using the Kohonen Network Incorporating Explicit Statistics}, booktitle = {Neural Nets WIRN VIETRI-98}, year = {1999}, pages = {273{\textendash}282}, publisher = {Springer London}, organization = {Springer London}, author = {Oommen, B John and Necati Aras and I. Kuban Altinel} } @article {1654599, title = {{Discrete vector quantization for arbitrary distance function estimation}}, journal = {IEEE Transactions on Systems, Man, and Cybernetics}, volume = {28}, year = {1998}, pages = {496{\textendash}510}, doi = {10.1109/3477.704289}, author = {John Oommen and I. Kuban Altinel and Necati Aras} } @article {14443912, title = {{Optimum component test plans for systems with dependent components}}, journal = {European Journal of Operational Research}, volume = {111}, year = {1998}, pages = {175{\textendash}186}, doi = {10.1016/S0377-2217(97)00355-X}, author = {I. Kuban Altinel and S{\"u}leyman {\"O}zekici} } @conference {oommen1997arbitrary, title = {Arbitrary distance function estimation using discrete vector quantization}, booktitle = {Neural Networks, 1997., International Conference on}, volume = {2}, year = {1997}, pages = {1272{\textendash}1277}, publisher = {IEEE}, organization = {IEEE}, author = {Oommen, John and I. Kuban Altinel and Necati Aras} } @article {49169217, title = {{Scheduling of batch processes: An industrial application in paint industry}}, journal = {Computers \& Chemical Engineering}, volume = {21}, year = {1997}, doi = {10.1016/S0098-1354(97)87580-1}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @article {859143, title = {{Vector Quantization for Arbitrary Distance Function Estimation}}, journal = {Informs Journal on Computing}, volume = {9}, year = {1997}, pages = {439{\textendash}451}, doi = {10.1287/ijoc.9.4.439}, author = {I. Kuban Altinel and John Oommen and Necati Aras} } @article {14551568, title = {{Scheduling of batch processes with operational uncertainties}}, journal = {Computers \& Chemical Engineering}, volume = {20}, year = {1996}, doi = {10.1016/0098-1354(96)00206-2}, author = {Seza Or{\c c}un and I. Kuban Altinel and {\"O}ner Horta{\c c}su} } @conference {50018430, title = {{Arbitrary distance function estimation using vector quantization}}, booktitle = {International Symposium on Neural Networks}, year = {1995}, doi = {10.1109/ICNN.1995.487272}, author = {John Oommen and I. Kuban Altinel and Necati Aras} }