@article {1537, title = {Semi-supervised extensions of multi-task tree ensembles}, journal = {Pattern Recognition}, volume = {123}, year = {2022}, pages = {108393}, abstract = {

Scale inconsistency is a widely encountered issue in multi-output learning problems. Specifically, target sets with multiple real valued or a mixture of categorical and real valued variables require addressing the scale differences to obtain predictive models with sufficiently good performance. Data transformation techniques are often employed to solve that problem. However, these operations are susceptible to different shortcomings such as changing the statistical properties of the data and increase the computational burden. Scale differences also pose problem in semi-supervised learning (SSL) models as they require processing of unsupervised information where distance measures are commonly employed. Classical distance metrics can be criticized as they lose efficiency when variables exhibit type or scale differences, too. Besides, in higher dimensions distance metrics cause problems due to loss of discriminative power. This paper introduces alternative semi-supervised tree-based strategies that are robust to scale differences both in terms of feature and target variables. We propose use of a scale-invariant proximity measure by means of tree-based ensembles to preserve the original characteristics of the data. We update classical tree derivation procedure to a multi-criteria form to resolve scale inconsistencies. We define proximity based clustering indicators and extend the supervised model with unsupervised criteria. Our experiments show that proposed method significantly outperforms its benchmark learning model that is predictive clustering trees.

}, keywords = {Ensemble learning, Multi-objective trees, Multi-task learning, Semi-supervised learning, Totally randomized trees}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2021.108393}, url = {https://www.sciencedirect.com/science/article/pii/S0031320321005549}, author = {Esra Ad{\i}yeke and Mustafa Gokce Baydogan} } @article {1513, title = {Dynamic trade-offs in granulocyte colony-stimulating factor (G-CSF) administration during chemotherapy}, journal = {System Dynamics Review}, volume = {36}, year = {2021}, pages = {397{\textendash}446}, abstract = {

Chemotherapeutic treatment of cancer comes with side effects on the immune system, such as Chemotherapy-Induced Neutropenia (CIN). A recombinant form of Granulocyte Colony-Stimulating Factor (G-CSF) has been used to alleviate CIN. This is a challenging task due to the feedback complexity of the hematological system. A System Dynamics model is constructed to study this system and to derive practical insights for the management of CIN. Stimulation of neutrophil production via G-CSF is observed to propose crucial trade-offs. On one hand, production by stem cells and mobilization from bone marrow should be stimulated to compensate for the impairment caused by chemotherapy. On the other hand, it is important to avoid overstimulation, which reduces the regenerative capacity, as well as draining the much-needed bone-marrow reservoir. Our analysis supports the intuition that the response to G-CSF administration is conditional to patient characteristics, and {\textquotedblleft}one for all{\textquotedblright} treatment protocols are impractical. {\textcopyright} 2021 System Dynamics Society.

}, issn = {10991727}, doi = {10.1002/sdr.1671}, author = {{\.I}rsoy, Orkun and G{\"u}z, {\c S}anser and Akan, Naz Beril and G{\"o}nen{\c c} Y{\"u}cel} } @article {1423, title = {An ensemble-based semi-supervised feature ranking for multi-target regression problems}, journal = {Pattern Recognition Letters}, volume = {148}, year = {2021}, pages = {36-42}, abstract = {

This study focuses on semi-supervised feature ranking (FR) applications for multi-target regression problems (MTR). As MTRs require prediction of several targets, we use a learning model that includes target interrelations via multi-objective trees. In processing the features for a semi-supervised learning model, transformation or scaling operations are usually required. To resolve this issue, we create a dissimilarity matrix via totally randomized trees to process the unsupervised information. Besides, we treat the split score function as a vector to make it suitable for considering each criterion regardless of their scales. We propose a semi-supervised FR scheme embedded to multi-objective trees that takes into account target and feature contributions simultaneously. Proposed FR score is compared with the state-of-the-art multi-target FR strategies via statistical analyses. Experimental studies show that proposed score significantly improves the performance of a recent tree-based and competitive multi-target learning model, i.e. predictive clustering trees. In addition, proposed approach outperforms its benchmarks when the available labelled data increase.

}, keywords = {Feature ranking, Multi-target regression, Semi-supervised learning}, issn = {0167-8655}, doi = {https://doi.org/10.1016/j.patrec.2021.04.025}, url = {https://www.sciencedirect.com/science/article/pii/S0167865521001641}, author = {Esra Ad{\i}yeke and Mustafa Gokce Baydogan} } @article {1422, title = {A new feature-based time series classification method by using scale-space extrema}, journal = {Engineering Science and Technology, an International Journal}, year = {2021}, abstract = {

Time series data mining has received significant attention over the past decade, and many approaches have focused on classification tasks where the goal is to define the label of a test time series, given labeled training data. Time series classification approaches can be broadly grouped into two categories as instance-based and feature-based methods. Instance-based approaches utilize similarity information in a nearest-neighbor setting to classify time series data. Although approaches from this category provide accurate results, their performance degrades with long and noisy time series. On the other hand, feature-based approaches extract features to deal with the limitations of instance-based approaches; however, these approaches work with predefined features and may not be successful in certain classification problems. This study proposes a time series classification approach that benefits from both scale-space theory and bag-of-features technique. The method starts with finding the scale-space extrema points (i.e. key points) of each time series according to the SiZer (SIgnificant ZERo crossings of the derivatives) method, and then proceeds to create the local features set around these points. After extraction of the local features from each key point, a bag-of-features representation for each time series is constructed as the summary of the key point characteristics. We evaluate the success of the proposed representation on time series classification problems from various domains. Our experimental results show that our proposal provides competitive results compared to widely used approaches in the literature.

}, keywords = {Bag-of-Features Technique, Feature-based Classification, Scale-Space Theory, SiZer, time series classification}, issn = {2215-0986}, doi = {https://doi.org/10.1016/j.jestch.2021.03.017}, url = {https://www.sciencedirect.com/science/article/pii/S2215098621000823}, author = {Tayip Altay and Mustafa Gokce Baydogan} } @article {1419, title = {The benefits of target relations: A comparison of multitask extensions and classifier chains}, journal = {Pattern Recognition}, volume = {107}, year = {2020}, pages = {107507}, abstract = {

Multitask (multi-target or multi-output) learning (MTL) deals with simultaneous prediction of several outputs. MTL approaches rely on the optimization of a joint score function over the targets. However, defining a joint score in global models is problematic when the target scales are different. To address such problems, single target (i.e. local) learning strategies are commonly employed. Here we propose alternative tree-based learning strategies to handle the issue with target scaling in global models, and to identify the learning order for chaining operations in local models. In the first proposal, the problems with target scaling are resolved using alternative splitting strategies which consider the learning tasks in a multi-objective optimization framework. The second proposal deals with the problem of ordering in the chaining strategies. We introduce an alternative estimation strategy, minimum error chain policy, that gradually expands the input space using the estimations that approximate to true characteristics of outputs, namely out-of-bag estimations in tree-based ensemble framework. Our experiments on benchmark datasets illustrate the success of the proposed multitask extension of trees compared to the decision trees with de facto design especially for datasets with large number of targets. In line with that, minimum error chain policy improves the performance of the state-of-the-art chaining policies.

}, keywords = {Classifier chains, Ensemble learning, Multi-objective trees, Multitask learning, Stacking}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2020.107507}, url = {https://www.sciencedirect.com/science/article/pii/S0031320320303101}, author = {Esra Ad{\i}yeke and Mustafa Gokce Baydogan} } @article {1425, title = {Decentralized decomposition algorithms for peer-to-peer linear optimization}, journal = {RAIRO-Oper. Res.}, volume = {54}, year = {2020}, pages = {1835-1861}, doi = {10.1051/ro/2019097}, url = {https://doi.org/10.1051/ro/2019097}, author = {Aydin, M. Asli and Z C Ta{\c s}k{\i}n} } @article {1441, title = {Exact solution algorithms for the maximum flow problem with additional conflict constraints}, journal = {European Journal of Operational Research}, volume = {287}, year = {2020}, pages = {410-437}, abstract = {

We consider a variant of the maximum flow problem on a given directed graph where some arc pairs are incompatible or conflicting; in other words, they are not allowed to carry positive flow simultaneously. This problem, called the maximum flow problem with conflicts, is known to be strongly NP-hard. In this paper, we present mixed-integer linear programming formulations for the problem and develop exact solution methods based on Benders decomposition, branch-and-bound, and Russian Doll Search over the conflict graph which represents the conflict relations. The effectiveness of the proposed algorithms is tested on a large number of randomly generated instances. The results reveal that their performances are superior to solving the mixed-integer linear programming formulations with a commercial software.

}, keywords = {Benders decomposition, Branch-and-bound, Combinatorial optimization, Conflict, Maximum flow, Russian doll search}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2020.04.001}, url = {https://www.sciencedirect.com/science/article/pii/S0377221720303192}, author = {Zeynep {\c S}uvak and I. Kuban Altinel and Necati Aras} } @article {1446, title = {Gradual covering location problem with multi-type facilities considering customer preferences}, journal = {Computers \& Industrial Engineering}, volume = {147}, year = {2020}, pages = {106577}, abstract = {

In this paper, we address a discrete facility location problem where a retailer aims at locating new facilities with possibly different characteristics. Customers visit the facilities based on their preferences which are represented as probabilities. These probabilities are determined in a novel way by using a fuzzy clustering algorithm. It is assumed that the sum of the probabilities with which customers at a given demand zone patronize different types of facilities is equal to one. However, among the same type of facilities they choose the closest facility, and the strength at which this facility covers the customer is based on two distances referred to as full coverage distance and gradual (partial) coverage distance. If the distance between the customer location and the closest facility is smaller (larger) than the full (partial) coverage distance, this customer is fully (not) covered, whereas for all distance values between full and partial coverage, the customer is partially covered. Both distance values depend on both the customer attributes and the type of the facility. Furthermore, facilities can only be opened if their revenue exceeds a certain threshold value. A final restriction is incorporated into the model by defining a minimum separation distance between the same facility types. This restriction is also extended to the case where a minimum threshold distance exists among facilities of different types. The objective of the retailer is to find the optimal locations and types of the new facilities in order to maximize its profit. Two versions of the problem are formulated using integer linear programming, which differ according to whether the minimum separation distance applies to the same facility type or different facility types. The resulting integer linear programming models are solved by three approaches: commercial solver CPLEX, heuristics based on Lagrangean relaxation, and local search implemented with 1-Add and 1-Swap moves. Apart from experimentally assessing the accuracy and the efficiency of the solution methods on a set of randomly generated test instances, we also carry out sensitivity analysis using a real-world problem instance.

}, keywords = {Customer preferences, Facility location, Fuzzy c-means clustering, Gradual coverage, Lagrangean relaxation}, issn = {0360-8352}, doi = {https://doi.org/10.1016/j.cie.2020.106577}, url = {https://www.sciencedirect.com/science/article/pii/S0360835220303119}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras} } @article {1436, title = {Minimizing the misinformation spread in social networks}, journal = {IISE Transactions}, volume = {52}, year = {2020}, pages = {850-863}, abstract = {

AbstractThe Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player{\textquoteright}s problem. In both of them, the second player{\textquoteright}s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.

}, doi = {10.1080/24725854.2019.1680909}, url = {https://doi.org/10.1080/24725854.2019.1680909}, author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel and Evren G{\"u}ney} } @article {1448, title = {The r-interdiction selective multi-depot vehicle routing problem}, journal = {International Transactions in Operational Research}, volume = {27}, year = {2020}, pages = {835-866}, abstract = {

Abstract The protection of critical facilities has been attracting increasing attention in the past two decades. Critical facilities involve physical assets such as bridges, railways, power plants, hospitals, and transportation hubs among others. In this study we introduce a bilevel optimization problem for the determination of the most critical depots in a vehicle routing context. The problem is modeled as an attacker{\textendash}defender game (Stackelberg game) from the perspective of an adversary agent (the attacker) who aims to inflict maximum disruption on a routing network. We refer to this problem as the r-interdiction selective multi-depot vehicle routing problem (RI-SMDVRP). The attacker is the decision maker in the upper level problem (ULP) who chooses r depots to interdict with certainty. The defender is the decision maker in the lower level problem (LLP) who optimizes the vehicle routes in the wake of the attack. The defender has to satisfy all customer demand either using the remaining depots or through outsourcing to a third party logistics service provider. The ULP is solved through exhaustive enumeration, which is viable when the cardinality of interdictions does not exceed five among nine depots. For the LLP we implement a tabu search heuristic adapted to the selective multi-depot VRP. Our results are obtained on a set of RI-SMDVRP instances synthetically constructed from standard MDVRP test instances.

}, keywords = {bilevel programming, interdiction, multi-depot vehicle routing problem, outsourcing, tabu search}, doi = {https://doi.org/10.1111/itor.12669}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12669}, author = {Sadati, Mir Ehsan Hesam and Aksen, Deniz and Necati Aras} } @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 {1427, title = {A strong integer programming formulation for hybrid flowshop scheduling}, journal = {Journal of the Operational Research Society}, volume = {71}, year = {2020}, pages = {2042-2052}, doi = {10.1080/01605682.2019.1654414}, url = {https://doi.org/10.1080/01605682.2019.1654414}, author = {Ali Tamer {\"U}nal and Semra A{\u g}ral{\i} and Z C Ta{\c s}k{\i}n} } @article {1447, title = {A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection}, journal = {Computers \& operations research}, volume = {123}, year = {2020}, pages = {104996}, author = {Sadati, Mir Ehsan Hesam and Aksen, Deniz and Necati Aras} } @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 {1432, title = {The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)}, journal = {European Journal of Operational Research}, volume = {272}, year = {2019}, pages = {372-388}, abstract = {

The success of radiation therapy depends on the ability to deliver the proper amount of radiation to cancerous cells while protecting healthy tissues. As a natural consequence, any new treatment technology improves quality standards concerning primarily this issue. Similar to the widely used Intensity Modulated Radiation Therapy (IMRT), the radiation resource is outside of the patient{\textquoteright}s body and the beam is shaped by a multi-leaf collimator mounted on the linear accelerator{\textquoteright}s head during the state-of-the-art Volumetric Modulated Arc Therapy (VMAT) as well. However, unlike IMRT, the gantry of the accelerator may rotate along one or more arcs and deliver radiation continuously. This property makes VMAT powerful in obtaining high conformal plans in terms of dose distribution; but the apertures are interdependent and optimal treatment planning problem cannot be decomposed into simpler independent subproblems as a consequence. In this work, we consider optimal treatment planning problem for VMAT. First, we formulate a mixed-integer linear program minimizing total radiation dose intensity subject to clinical requirements embedded within the constraints. Then, we develop efficient solution procedures combining Benders decomposition with certain acceleration strategies. We investigate their performance on a large set of test instances obtained from an anonymous real prostate cancer data.

}, keywords = {algorithms, Benders decomposition, integer programming, Radiation therapy, VMAT}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2018.06.023}, url = {https://www.sciencedirect.com/science/article/pii/S0377221718305514}, author = {P{\i}nar Dursun and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @article {1437, title = {Influence maximization with deactivation in social networks}, journal = {European Journal of Operational Research}, volume = {278}, year = {2019}, pages = {105-119}, abstract = {

In this paper, we consider an extension of the well-known Influence Maximization Problem in a social network which deals with finding a set of k nodes to initiate a diffusion process so that the total number of influenced nodes at the end of the process is maximized. The extension focuses on a competitive variant where two decision makers are involved. The first one, the leader, tries to maximize the total influence spread by selecting the most influential nodes and the second one, the follower, tries to minimize it by deactivating some of these nodes. The formulated bilevel model is solved by complete enumeration for small-sized instances and by a matheuristic for large-sized instances. In both cases, the lower level problem, which is a stochastic optimization problem, is approximated via the Sample Average Approximation method.

}, keywords = {Bilevel modeling, Influence maximization, Matheuristics, Metaheuristics, Stochastic optimization}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2019.04.010}, url = {https://www.sciencedirect.com/science/article/pii/S0377221719303303}, author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel} } @article {1444, title = {An integrated disaster preparedness model for retrofitting and relief item transportation}, journal = {Networks and Spatial Economics}, volume = {19}, year = {2019}, pages = {1031{\textendash}1068}, author = {D{\"o}yen, Alper and Necati Aras} } @article {1434, title = {Minimum cost noncrossing flow problem on layered networks}, journal = {Discrete Applied Mathematics}, volume = {261}, year = {2019}, pages = {2-21}, abstract = {

In this work we focus on an extension of the minimum cost flow problem in layered networks. Feasible arc flows must satisfy a specific compatibility restriction in addition to flow balance and capacity restrictions. Namely, at most one of the crossing arcs is allowed to have positive flow on it. This variant of the minimum cost flow problem, which we call the minimum cost noncrossing flow problem, can frequently be encountered in real life. The determination of optimal temporal quay crane allocations to berthed vessels in container terminals, and optimal train schedules through the stations on the same railroad line are two examples. We first analyze the complexity of the problem and show that the noncrossing flow problem is in fact NP-complete in a layered network. Then, we introduce mixed-integer linear programming formulations and discuss a polynomially solvable special case. Next we show a sufficient condition for the existence of a crossing in an optimal solution, which can be used for preprocessing the arcs in order to reduce the problem size. Our computational experiments on a large test set show that our preprocessing algorithm can significantly reduce the number of arcs.

}, keywords = {integer programming, Layered networks, Network flows, Noncrossing flow}, issn = {0166-218X}, doi = {https://doi.org/10.1016/j.dam.2018.09.016}, url = {https://www.sciencedirect.com/science/article/pii/S0166218X18304815}, author = {I. Kuban Altinel and Necati Aras and Zeynep {\c S}uvak and Z C Ta{\c s}k{\i}n} } @article {1438, title = {Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms}, journal = {European Journal of Operational Research}, volume = {277}, year = {2019}, pages = {62-83}, abstract = {

A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two-dimensional image of a shape. The use of a rectangle blanket is a widely considered strategy for speeding-up the computations in many computer vision applications. Since neither the rectangles nor the image have to be fully covered by the other, the blanket becomes more precise as the non-overlapping area of the image and the blanket decreases. In this work, we focus on the rectangle blanket problem, which involves the determination of an optimum blanket minimizing the non-overlapping area with a given image subject to an upper bound on the total number of rectangles the blanket can include. This problem has similarities with rectangle covering, rectangle partitioning and cutting/packing problems. The image replaces an irregular master object by an approximating set of smaller axis-aligned rectangles. The union of these rectangles, namely, the rectangle blanket, is neither restricted to remain entirely within the master object, nor required to cover the master object completely. We first develop a binary integer linear programming formulation of the problem. Then, we introduce four methods for its solution. The first one is a branch-and-price algorithm that computes an exact optimal solution. The second one is a new constrained simulated annealing heuristic. The last two are heuristics adopting ideas available in the literature for other computer vision related problems. Finally, we realize extensive computational tests and report results on the performances of these algorithms.

}, keywords = {Branch-and-price, Computer vision, Cutting /Packing, Heuristics, integer programming}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2019.02.004}, url = {https://www.sciencedirect.com/science/article/pii/S0377221719301158}, author = {Bar{\i}{\c s} Evrim Demir{\"o}z and I. Kuban Altinel and Lale Akarun} } @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 {1429, title = {Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)}, journal = {Computers \& Operations Research}, volume = {110}, year = {2019}, pages = {1-17}, abstract = {

Volumetric Modulated Arc Therapy (VMAT) is the state-of-the-art technique for external radiation therapy treatment. In this method, radiation can be delivered continuously on one or more arcs during the rotation of the gantry of the linear accelerator. This property makes VMAT powerful in obtaining high conformal plans in terms of dose distribution within short treatment times. However, the apertures composed by the leaves of the multileaf collimator (MLC) system that shapes continuously the radiation are interdependent, which makes treatment planning hard. We propose a mixed integer linear programming model for VMAT planning problem and exact branch-and-price algorithms to solve it. The objective of the model is to minimize total radiation that is delivered to the patient, and pricing subproblem is decomposable by rows of the MLC and can be solved as a shortest path problem. We generate a large set of test instances from a real data set and evaluate the performance of the proposed branch-and-price algorithm. Computational results reveal that new algorithms are efficient and capable of finding optimal solutions for large problem instances.

}, keywords = {Branch-and-price, Column generation, integer programming, Radiation therapy, Shortest path problem, VMAT}, issn = {0305-0548}, doi = {https://doi.org/10.1016/j.cor.2019.05.018}, url = {https://www.sciencedirect.com/science/article/pii/S0305054819301315}, author = {P{\i}nar Dursun and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @article {1443, title = {Determining the most vulnerable components in a transportation network}, journal = {Sigma}, volume = {9}, year = {2018}, pages = {371{\textendash}382}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras} } @article {1509, title = {Equimatchable claw-free graphs}, journal = {Discrete Mathematics}, volume = {341}, year = {2018}, pages = {2859-2871}, abstract = {

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm.

}, keywords = {Connectivity, Equimatchable graph, Factor-critical}, issn = {0012-365X}, doi = {https://doi.org/10.1016/j.disc.2018.06.043}, url = {https://www.sciencedirect.com/science/article/pii/S0012365X18302140}, author = {Saieed Akbari and Hadi Alizadeh and Ekim, Tinaz and Didem G{\"o}z{\"u}pek and Mordechai Shalom} } @article {1435, title = {Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem}, journal = {INFORMS Journal on Computing}, volume = {30}, year = {2018}, pages = {43-56}, abstract = {

We investigate the maximum induced matching problem (MIM), which is the problem of finding an induced matching having the largest cardinality on an undirected graph. The problem is known to be NP-hard for general graphs. We first propose a vertex-based integer programming formulation for MIM, which is more compact compared to an edge-based formulation found in the literature. We also introduce the maximum weight induced matching problem (MWIM), which generalizes MIM so that vertices and edges have weights. We adapt the edge-based formulation to MWIM, and propose a quadratic programming formulation of MWIM based on our vertex-based formulation. We then linearize our quadratic programming formulation, and devise a Benders decomposition algorithm that exploits a special structure of the linearized formulation. We also propose valid inequalities and formulation tightening procedures to improve the efficiency of our approach. Our computational tests on a large suite of randomly generated graphs show that our vertex-based formulation and decomposition approach significantly improve the solvability of MIM and MWIM, especially on dense graphs. The online appendix and data are available at https://doi.org/10.1287/ijoc.2017.0764.

}, doi = {10.1287/ijoc.2017.0764}, url = {https://doi.org/10.1287/ijoc.2017.0764}, author = {Ahat, Bet{\"u}l and Ekim, Tinaz and Z C Ta{\c s}k{\i}n} } @article {1442, title = {Robust supply chain network design with multi-products for a company in the food sector}, journal = {Applied Mathematical Modelling}, volume = {60}, year = {2018}, pages = {526-539}, abstract = {

The paper aims to solve a problem faced by a company competing in the snacks market in Turkey. In line with the growth in this market, the company needs to make important decisions over the next few years about the timing and location of a new plant, its initial capacity, the timing and amount of additional capacity to be installed at the new and existing plants, the assignment of demand points to plants and the amount of raw materials to be shipped from suppliers to the plants in each period. The objective is to minimize the total cost of various components. The problem is formulated as a multi-period supply chain network design model with multi products. The resulting mixed-integer linear programming model is solved by the commercial solver CPLEX. This model enables us to carry out all analyses requested by the company in an efficient way. After this deterministic model is solved on the basis of a 9\% annual increase in demand, it is extended to a minimax regret model to deal with uncertainty in demand quantities. The results suggest that opening the new plant in the city of {\.I}zmir is indeed a robust solution that is unaffected in different scenarios that are based on three distinct demand increase rates. Even though the location of the new plant remains unchanged with respect to scenarios, the optimal robust solution differs from the optimal solution of each scenario in terms of the capacity expansion decisions. After all obtained results had been communicated to the company managers and executives, the new plant construction was started in 2016 very close to the city that the mathematical model had determined. The new plant is expected to start operating in 2018.

}, keywords = {Demand uncertainty, Facility location-allocation, Mixed-integer linear programming, Robust optimization, Supply chain network design}, issn = {0307-904X}, doi = {https://doi.org/10.1016/j.apm.2018.03.034}, url = {https://www.sciencedirect.com/science/article/pii/S0307904X18301586}, author = {Necati Aras and {\"U}mit Bilge} } @inbook {1187, title = {Affect measurement: A roadmap through approaches, technologies, and data analysis}, booktitle = {Emotions and Affect in Human Factors and Human-Computer Interaction}, year = {2017}, pages = {255{\textendash}288}, publisher = {Elsevier}, organization = {Elsevier}, author = {Gonzalez-Sanchez, Javier and Mustafa Gokce Baydogan and Chavez-Echeagaray, Maria Elena and Atkinson, Robert K and Burleson, Winslow} } @inbook {1186, title = {Bilevel Models on the Competitive Facility Location Problem}, booktitle = {Spatial Interaction Models}, year = {2017}, pages = {1{\textendash}19}, publisher = {Springer}, organization = {Springer}, author = {Necati Aras and K{\"u}{\c c}{\"u}kayd{\i}n, Hande} } @article {1507, title = {Complexity of the Improper Twin Edge Coloring of Graphs}, journal = {Graphs and Combinatorics}, volume = {33}, year = {2017}, pages = {595{\textendash}615}, author = {Abedin, Paniz and Akbari, Saieed and Demange, Marc and Ekim, Tinaz} } @article {1164, title = {Designing distribution systems with reverse flows}, journal = {Journal of Remanufacturing}, volume = {7}, year = {2017}, pages = {113{\textendash}137}, author = {Tombu{\c s}, Ay{\c s}e Cilac{\i} and Necati Aras and Verter, Vedat} } @article {1090, title = {Employee Scheduling in Service Industries with Flexible Employee Availability and Demand}, journal = {Omega}, volume = {66}, year = {2017}, pages = {159-169}, doi = {http://dx.doi.org/10.1016/j.omega.2016.03.001}, author = {Semra A{\u g}ral{\i} and Z C Ta{\c s}k{\i}n and Ali Tamer {\"U}nal} } @proceedings {1181, title = {The Impact of Orbit Dependent Return Rate on the Control Policies of a Hybrid Production System}, journal = {11th SMMSO Conference }, year = {2017}, author = {Aybek Korugan and S. Ata and M. Fad{\i}lo{\u g}lu} } @article {1165, title = {Multi-dimensional clearing functions for aggregate capacity modelling in multi-stage production systems}, journal = {International Journal of Production Research}, volume = {55}, year = {2017}, pages = {4164{\textendash}4179}, author = {Albey, Erin{\c c} and {\"U}mit Bilge and Uzsoy, Reha} } @article {1163, title = {Optimal sensor deployment to increase the security of the maximal breach path in border surveillance}, journal = {European Journal of Operational Research}, volume = {259}, year = {2017}, pages = {19{\textendash}36}, author = {Karabulut, Ezgi and Necati Aras and I. Kuban Altinel} } @conference {1167, title = {A scale-space theory and bag-of-features based time series classification method}, booktitle = {Signal Processing and Communications Applications Conference (SIU), 2017 25th}, year = {2017}, publisher = {IEEE}, organization = {IEEE}, author = {Altay, Tayip and Mustafa Gokce Baydogan} } @proceedings {1190, title = {Modeling the Long Term Dynamics of Obesity as a Societal Epidemic}, journal = {34th International Conference of the System Dynamics Society}, year = {2016}, address = {Delft, the Netherlands}, author = {Akta{\c s}, Gizem and Nefel Tellio{\u g}lu and Yaman Barlas and Hakan Ya{\c s}arcan} } @article {1173, title = {A new multi-objective mathematical model for the high-level synthesis of integrated circuits}, journal = {Applied Mathematical Modelling}, volume = {40}, year = {2016}, pages = {2274{\textendash}2290}, author = {Necati Aras and Yurdakul, Arda} } @article {1171, title = {Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals}, journal = {European Journal of Operational Research}, volume = {254}, year = {2016}, pages = {985{\textendash}1001}, author = {T{\"u}rko{\u g}ullar{\i}, Yavuz B and Z. Caner Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {1089, title = {Optimal Berth Allocation, Time-variant Quay Crane Assignment and Scheduling with Crane Setups in Container Terminals}, journal = {European Journal of Operational Research}, volume = {254}, year = {2016}, pages = {985-1001}, doi = {http://dx.doi.org/10.1016/j.ejor.2016.04.022}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Z C Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {1194, title = {Optimal Sensor Deployment to Increase the Security of the Maximal Breach Path in Border Surveillance}, year = {2016}, institution = {Bo{\u g}azi{\c c}i University}, author = {Karabulut E and Necati Aras and I. Kuban Altinel} } @article {1512, title = {Advances on defective parameters in graphs}, journal = {Discrete Optimization}, volume = {16}, year = {2015}, pages = {62-69}, abstract = {

We consider the generalization of Ramsey numbers to the defective framework using k-dense and k-sparse sets. We construct the first tableaux for defective Ramsey numbers with exact values whenever it is known, and lower and upper bounds otherwise. In light of defective Ramsey numbers, we consider the defective cocoloring problem which consists of partitioning the vertex set of a given graph into k-sparse and k-dense sets. By the help of efficient graph generation methods, we show that c0(4)=12,c1(3)=12 and c2(2)=10 where ck(m) is the maximum order n such that all n-graphs can be k-defectively cocolored using at most m colors. We also give the numbers of k-defective m-cocritical graphs of order n (until n=10) for different levels of defectiveness and m=2,3 and 4.

}, keywords = {Cocritical graphs, Defective cocoloring, Defective Ramsey numbers, Efficient graph generation}, issn = {1572-5286}, doi = {https://doi.org/10.1016/j.disopt.2015.01.002}, url = {https://www.sciencedirect.com/science/article/pii/S1572528615000031}, author = {Ahu Akdemir and Ekim, Tinaz} } @article {1467, title = {Locating recycling facilities for IT based electronic waste in Turkey}, journal = {Journal of Cleaner Production}, volume = {105}, year = {2015}, month = {Oct}, pages = {324{\textendash}336}, issn = {09596526}, author = {Necati Aras and Aybek Korugan and B{\"U}Y{\"U}K{\"O}ZKAN FEYZ{\.I}O{\u G}LU, G{\"U}L{\c C}{\.I}N and S{\.I}VR{\.I}KAYA {\c S}ER{\.I}FO{\u G}LU, FUNDA and Erol, Ismail and Nurtani{\c s} Velio{\u g}lu, Meltem} } @article {786, title = {Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics}, journal = {Interfaces}, volume = {45}, year = {2015}, pages = {325-340}, doi = {http://dx.doi.org/10.1287/inte.2015.0793}, author = {Z C Ta{\c s}k{\i}n and Semra A{\u g}ral{\i} and Ali Tamer {\"U}nal and Vahdet Belada and Filiz G{\"o}kten-Y{\i}lmaz} } @article {aksen2014bilevel, title = {A bilevel partial interdiction problem with capacitated facilities and demand outsourcing}, journal = {Computers \& Operations Research}, volume = {41}, year = {2014}, pages = {346{\textendash}358}, publisher = {Pergamon}, author = {Aksen, Deniz and {\c S}eng{\"u}l Akca, Sema and Necati Aras} } @article {albey2014exploratory, title = {An exploratory study of disaggregated clearing functions for production systems with multiple products}, journal = {International Journal of Production Research}, number = {ahead-of-print}, year = {2014}, pages = {1{\textendash}22}, publisher = {Taylor \& Francis}, author = {Albey, Erin{\c c} and {\"U}mit Bilge and Uzsoy, Reha} } @article {TurkogullariEtAl2014, title = {Optimal berth allocation and time-invariant quay crane assignment in container terminals}, journal = {European Journal of Operational Research}, volume = {235}, number = {1}, year = {2014}, pages = {88{\textendash}101}, doi = {http://dx.doi.org/10.1016/j.ejor.2013.10.015}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Z C Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @inbook {aras2014simultaneous, title = {Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals}, booktitle = {Operations Research Proceedings 2012}, year = {2014}, pages = {101{\textendash}107}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, author = {Necati Aras and T{\"u}rko{\u g}ullar{\i}, Yavuz and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @article {keskin2014wireless, title = {Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility}, journal = {Ad Hoc Networks}, volume = {17}, year = {2014}, pages = {18{\textendash}36}, publisher = {Elsevier}, author = {Keskin, M Emre and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @conference {39, title = {Affect Recognition in Learning Scenarios: Matching Facial-and BCI-Based Values}, booktitle = {13th IEEE International Conference on Advanced Learning Technologies (ICALT{\textquoteright}13)}, year = {2013}, publisher = {IEEE}, organization = {IEEE}, author = {Javier Gonzalez-Sanchez and Maria Elena Chavez-Echeagaray and Lijia Lin and Mustafa Gokce Baydogan and Robert Christopherson and David Gibson and Robert Atkinson and Winslow Burleson} } @article {aksen2013bilevel, title = {A bilevel p-median model for the planning and protection of critical facilities}, journal = {Journal of Heuristics}, volume = {19}, number = {2}, year = {2013}, pages = {373{\textendash}398}, publisher = {Springer US}, author = {Aksen, Deniz and Necati Aras and Piyade, Nuray} } @article {bacsdere2013leader, title = {A leader-follower game for the point coverage problem in wireless sensor networks}, journal = {European Journal of Industrial Engineering}, volume = {7}, number = {5}, year = {2013}, pages = {635{\textendash}656}, publisher = {Inderscience Publishers}, author = {Ba{\c s}dere, Mehmet and Necati Aras and I. Kuban Altinel and Af{\c s}ar, Sezin} } @article {bilge2013mathematical, title = {Mathematical models for FMS loading and part type selection with flexible process plans}, journal = {European Journal of Industrial Engineering}, year = {2013}, publisher = {Inderscience}, author = {{\"U}mit Bilge and Albey, Erin{\c c} and Be{\c s}ikci, Umut and Erbatur, Kemalettin and Aslan, Ay{\c s}e Nur} } @inbook {aksen2013matheuristic, title = {A Matheuristic for Leader-Follower Games Involving Facility Location-Protection-Interdiction Decisions}, booktitle = {Metaheuristics for Bi-level Optimization}, year = {2013}, pages = {115{\textendash}151}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Aksen, Deniz and Necati Aras} } @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} } @article {aksen2012bilevel, title = {A bilevel fixed charge location model for facilities under imminent attack}, journal = {Computers \& Operations Research}, volume = {39}, number = {7}, year = {2012}, pages = {1364{\textendash}1381}, publisher = {Pergamon}, author = {Aksen, Deniz and Necati Aras} } @article {kucukaydin2012ciftduzeyli, title = {Ciftduzeyli Bir Rekabetci Tesis Yer Secimi Problemi Icin Tabu Arama Sezgiseli}, journal = {Endustri Muhendisligi Dergisi}, volume = {23}, number = {1}, year = {2012}, publisher = {TMMOB Makina Muhendisleri Odasi}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {guney2012efficient, title = {Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks}, journal = {Computers \& Operations Research}, volume = {39}, number = {7}, year = {2012}, pages = {1530{\textendash}1539}, publisher = {Elsevier}, author = {G{\"u}ney, Evren and Necati Aras and I. Kuban Altinel and Ersoy, Cem} } @article {AgraliEtAl2012, title = {A Facility Location Model with Safety Stock Costs: Analysis of the Cost of Single-Sourcing Requirements}, journal = {Journal of Global Optimization}, volume = {54(3)}, year = {2012}, pages = {551-581}, doi = {http://dx.doi.org/10.1007/s10898-011-9777-z}, author = {Semra A{\u g}ral{\i} and Joseph Geunes and Z C Ta{\c s}k{\i}n} } @conference {kucukaydin2012hybrid, title = {Hybrid Tabu Search Heuristics for a Bilevel Competitive Facility Location Model}, booktitle = {26th Annual Conference of the Belgian Operational Research Society}, year = {2012}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {keccici2012incorporating, title = {Incorporating the threat of terrorist attacks in the design of public service facility networks}, journal = {Optimization Letters}, volume = {6}, number = {6}, year = {2012}, pages = {1101{\textendash}1121}, publisher = {Springer-Verlag}, author = {Ke{\c c}ici, Serhat and Necati Aras and Verter, Vedat} } @article {kuccukaydin2012leader, title = {A leader{\textendash}follower game in competitive facility location}, journal = {Computers \& Operations Research}, volume = {39}, number = {2}, year = {2012}, pages = {437{\textendash}448}, publisher = {Elsevier}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {doyen2012two, title = {A two-echelon stochastic facility location model for humanitarian relief logistics}, journal = {Optimization Letters}, volume = {6}, number = {6}, year = {2012}, pages = {1123{\textendash}1145}, publisher = {Springer-Verlag}, author = {D{\"o}yen, Alper and Necati Aras and Barbaroso{\u g}lu, G{\"u}lay} } @article {14445765, title = {{Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution}}, journal = {European Journal of Operational Research}, volume = {208}, year = {2011}, pages = {206{\textendash}220}, doi = {10.1016/j.ejor.2010.08.009}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras and I. Kuban Altinel} } @article {kuccukaydin2011discrete, title = {A discrete competitive facility location model with variable attractiveness}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {9}, year = {2011}, pages = {1726{\textendash}1741}, publisher = {Nature Publishing Group}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, H and Necati Aras and I. Kuban Altinel} } @article {albey2011hierarchical, title = {A hierarchical approach to FMS planning and control with simulation-based capacity anticipation}, journal = {International Journal of Production Research}, volume = {49}, number = {11}, year = {2011}, pages = {3319{\textendash}3342}, publisher = {Taylor \& Francis}, author = {Albey, Erin{\c c} and {\"U}mit Bilge} } @article {keskin2011lifetime, title = {Lifetime maximization in wireless sensor networks using a mobile sink with nonzero traveling time}, journal = {The Computer Journal}, year = {2011}, pages = {bxr048}, publisher = {Oxford University Press}, author = {Keskin, M Emre and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @proceedings {seker, title = {Modeling the Dynamics of Thyroid Hormones and Related Disorders}, journal = {29th International Conference of the System Dynamics Society}, year = {2011}, author = {Oylum {\c S}eker and Yaman Barlas and Faruk Alag{\"o}l} } @article {aras2011optimal, title = {Optimal inventory and pricing policies for remanufacturable leased products}, journal = {International Journal of Production Economics}, volume = {133}, number = {1}, year = {2011}, pages = {262{\textendash}271}, publisher = {Elsevier}, author = {Necati Aras and Refik G{\"u}ll{\"u} and Y{\"u}r{\"u}lmez, Sevil} } @article {aras2011selective, title = {Selective multi-depot vehicle routing problem with pricing}, journal = {Transportation Research Part C: Emerging Technologies}, volume = {19}, number = {5}, year = {2011}, pages = {866{\textendash}884}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz and Tu{\u g}rul Tekin, Mehmet} } @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 {aksen2010budget, title = {The budget constrained r-interdiction median problem with capacity expansion}, journal = {Central European Journal of Operations Research}, volume = {18}, number = {3}, year = {2010}, pages = {269{\textendash}291}, publisher = {Springer-Verlag}, author = {Aksen, Deniz and Piyade, Nuray and Necati Aras} } @article {13998331, title = {{A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks}}, journal = {European Journal of Operational Research}, volume = {207}, year = {2010}, pages = {1014{\textendash}1026}, doi = {10.1016/j.ejor.2010.05.020}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {aras2010designing, title = {Designing the reverse logistics network}, journal = {Closed-loop supply chains: new developments to improve the sustainability of business practices. Auerbach Publications}, year = {2010}, pages = {67{\textendash}97}, author = {Necati Aras and Boyaci, Tamer and Verter, Vedat and Ferguson, M and Souza, GC} } @article {13288019, title = {{An efficient heuristic for placement, scheduling and routing in wireless sensor networks}}, journal = {Ad Hoc Networks}, volume = {8}, year = {2010}, pages = {654{\textendash}667}, doi = {10.1016/j.adhoc.2010.01.005}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {13988334, title = {{Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks}}, journal = {Computer Networks}, volume = {54}, year = {2010}, pages = {1805{\textendash}1822}, doi = {10.1016/j.comnet.2010.02.009}, author = {Evren G{\"u}ney and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {erol2010exploring, title = {Exploring reverse supply chain management practices in Turkey}, journal = {Supply Chain Management: An International Journal}, volume = {15}, number = {1}, year = {2010}, pages = {43{\textendash}54}, publisher = {Emerald Group Publishing Limited}, author = {Erol, Ismail and Velioglu, Meltem Nurtanis and Serifoglu, Funda Sivrikaya and B{\"u}y{\"u}k{\"o}zkan, G{\"u}l{\c c}in and Necati Aras and Cakar, Nigar Demircan and Aybek Korugan} } @book {13986675, title = {{A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model}}, series = {Hybrid Metaheuristics}, year = {2010}, pages = {31{\textendash}45}, doi = {10.1007/978-3-642-16054-7_3}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras and I. Kuban Altinel} } @conference {aras2010location, title = {Location and selective routing problem with pricing for the collection of used products}, booktitle = {Computers and Industrial Engineering (CIE), 2010 40th International Conference on}, year = {2010}, pages = {1{\textendash}6}, publisher = {IEEE}, organization = {IEEE}, author = {Necati Aras and Aksen, Deniz and Tekin, Tugrul} } @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 {turkougullari2010optimal, title = {Optimal placement, scheduling, and routing to maximize lifetime in sensor networks}, journal = {Journal of the Operational Research Society}, volume = {61}, number = {6}, year = {2010}, pages = {1000{\textendash}1012}, publisher = {Nature Publishing Group}, author = {T{\"u}rko{\u g}ullar{\i}, YB and Necati Aras and I. Kuban Altinel and Ersoy, Cem} } @book {13282841, title = {{A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks}}, series = {EvoWorkshops}, year = {2010}, pages = {83{\textendash}94}, doi = {10.1007/978-3-642-12139-5_8}, author = {Evren G{\"u}ney and I. Kuban Altinel and Necati Aras and Cem Ersoy} } @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} } @article {TaskinEtAl2009a, title = {Cutting Plane Algorithms for Solving a Stochastic Edge-Partition Problem}, journal = {Discrete Optimization}, volume = {6}, number = {4}, year = {2009}, pages = {420-435}, doi = {http://dx.doi.org/10.1016/j.disopt.2009.05.004}, author = {Z C Ta{\c s}k{\i}n and J. Cole Smith and Shabbir Ahmed and Andrew J. Schaefer} } @article {aksen2009design, title = {Design and analysis of government subsidized collection systems for incentive-dependent returns}, journal = {International Journal of Production Economics}, volume = {119}, number = {2}, year = {2009}, pages = {308{\textendash}327}, publisher = {Elsevier}, author = {Aksen, Deniz and Necati Aras and Karaarslan, Ay{\c s}e G{\"o}n{\"u}l} } @article {4756751, title = {{Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations}}, journal = {Computers \& Operations Research}, volume = {36}, year = {2009}, pages = {2139{\textendash}2148}, doi = {10.1016/j.cor.2008.08.003}, author = {Engin Durmaz and Necati Aras and I. Kuban Altinel} } @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} } @conference {50780509, title = {{A Variable Neighborhood Search Heuristic for Point Coverage, Sink Location and Data Routing in Wireless Sensor Networks}}, booktitle = {International Conference on Communication Theory, Reliability, and Quality of Service}, year = {2009}, doi = {10.1109/CTRQ.2009.33}, author = {Evren G{\"u}ney and I. Kuban Altinel and Necati Aras and Cem Ersoy} } @article {4363814, title = {{Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks}}, journal = {Computer Networks}, volume = {52}, year = {2008}, pages = {2419{\textendash}2431}, doi = {10.1016/j.comnet.2008.05.002}, author = {I. Kuban Altinel and Necati Aras and Evren G{\"u}ney and Cem Ersoy} } @article {1480, title = {CO2, GDP and RET: An aggregate economic equilibrium analysis for Turkey}, journal = {Energy Policy}, volume = {36}, year = {2008}, pages = {2694-2708}, abstract = {

There is a worldwide interest in renewable electricity technologies (RETs) due to growing concerns about global warming and climate change. As an EU candidate country whose energy demand increases exponentially, Turkey inevitably shares this common interest on RET. This study, using an aggregate economic equilibrium model, explores the economic costs of different policy measures to mitigate CO2 emissions in Turkey. The model combines energy demands, capital requirements and labor inputs at a constant elasticity of substitution under an economy-wide nested production function. Growing energy demand, triggered by economic growth, is met by increased supply and initiates new capacity additions. Investment into RET is encouraged via the incorporation of (a) endogenous technological learning through which the RET cost declines as a function of cumulative capacity, and (b) a willingness to pay (WTP) function which imposes the WTP of consumers as a lower bound on RET installation. The WTP equation is obtained as a function of consumer income categories, based on data gathered from a pilot survey in which the contingent valuation methodology was employed. The impacts of various emission reduction scenarios on GDP growth and RET diffusion are explored. As expected, RET penetration is accelerated under faster technological learning and higher WTP conditions. It is found that stabilizing CO2 emissions to year 2005 levels causes economic losses amounting to 17\% and 23\% of GDP in the years 2020 and 2030, respectively.

}, keywords = {Energy and environmental policy modeling, Learning (experience) curves, Willingness to pay for CO emission reduction}, issn = {0301-4215}, doi = {https://doi.org/10.1016/j.enpol.2008.03.026}, url = {https://www.sciencedirect.com/science/article/pii/S030142150800164X}, author = {G{\"u}rkan Kumbaro{\u g}lu and Nihan Karal{\i} and Y{\i}ld{\i}z Ar{\i}kan} } @conference {50713928, title = {{An efficient heuristic for placement, scheduling and routing in wireless sensor networks}}, booktitle = {International Symposium on Computer and Information Sciences}, year = {2008}, doi = {10.1109/ISCIS.2008.4717856}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @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} } @conference {guney2008efficient, title = {Efficient integer programming formulations for optimum sink location and routing in wireless sensor networks}, booktitle = {Computer and Information Sciences, 2008. ISCIS{\textquoteright}08. 23rd International Symposium on}, year = {2008}, pages = {1{\textendash}6}, publisher = {IEEE}, organization = {IEEE}, author = {Guney, E and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @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 {Aras2008a, title = {Locating collection centers for distance-and incentive-dependent returns}, journal = {International Journal of Production Economics}, volume = {111}, number = {2}, year = {2008}, pages = {316{\textendash}333}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz} } @article {Aras2008, title = {Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles}, journal = {European Journal of Operational Research}, volume = {191}, number = {3}, year = {2008}, pages = {1223{\textendash}1240}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz and G{\"o}n{\"u}l Tanu{\u g}ur, Ay{\c s}e} } @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 {bilge2008parametric, title = {A parametric fuzzy logic approach to dynamic part routing under full routing flexibility}, journal = {Computers \& Industrial Engineering}, volume = {55}, number = {1}, year = {2008}, pages = {15{\textendash}33}, publisher = {Elsevier}, author = {{\"U}mit Bilge and F{\i}rat, Murat and Albey, Erin{\c c}} } @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} } @conference {50632893, title = {{Optimal placement and activity scheduling to maximize coverage lifetime in wireless sensor networks}}, booktitle = {International Symposium on Computer and Information Sciences}, year = {2007}, doi = {10.1109/ISCIS.2007.4456874}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @inbook {aras2007solving, title = {Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms}, booktitle = {Metaheuristics}, year = {2007}, pages = {91{\textendash}112}, publisher = {Springer US}, organization = {Springer US}, author = {Necati Aras and Yumusak, Sadettin and I. Kuban Altinel} } @article {aras2006coordination, title = {Coordination and priority decisions in hybrid manufacturing/remanufacturing systems}, journal = {Production and Operations Management}, volume = {15}, number = {4}, year = {2006}, pages = {528{\textendash}543}, publisher = {Wiley Online Library}, author = {Necati Aras and Verter, Vedat and Boyaci, Tamer} } @inbook {aksen2006customer, title = {Customer selection and profit maximization in vehicle routing problems}, booktitle = {Operations Research Proceedings 2005}, year = {2006}, pages = {37{\textendash}42}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Aksen, Deniz 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 {50507263, title = {{Effective coverage in sensor networks: Binary integer programming formulations and heuristics}}, volume = {9}, year = {2006}, pages = {4014{\textendash}4019}, doi = {10.1109/ICC.2006.255709}, author = {I. Kuban Altinel and Necati Aras and Evren G{\"u}ney and Cem Ersoy} } @proceedings {kizilaslaneffects, title = {EFFECTS OF FREQUENCY, GRIP FORCE, AND GENDER ON THE PERCEPTION OF STEERING WHEEL LONGITUDINAL VIBRATION}, year = {2006}, author = {K{\i}z{\i}laslan, Kemal and Mahmut Ek{\c s}io{\u g}lu and Amman, Scott A} } @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 {ray2005optimal, title = {Optimal prices and trade-in rebates for durable, remanufacturable products}, journal = {Manufacturing \& Service Operations Management}, volume = {7}, number = {3}, year = {2005}, pages = {208{\textendash}228}, publisher = {INFORMS}, author = {Ray, Saibal and Boyaci, Tamer and Necati Aras} } @article {aras2004effect, title = {The effect of categorizing returned products in remanufacturing}, journal = {IIE Transactions}, volume = {36}, number = {4}, year = {2004}, pages = {319{\textendash}331}, publisher = {Taylor \& Francis}, author = {Necati Aras and Boyaci, Tamer and Verter, Vedat} } @article {56229753, title = {{Product-line selection and pricing with remanufacturing under availability constraints}}, volume = {5583}, year = {2004}, pages = {244{\textendash}255}, doi = {10.1117/12.572218}, author = {Necati Aras and G{\"o}k{\c c}e Esenduran 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 {14086928, title = {{A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries}}, journal = {European Journal of Operational Research}, volume = {137}, year = {2002}, pages = {483{\textendash}496}, doi = {10.1016/S0377-2217(01)00066-2}, author = {Murat Draman and I. Kuban Altinel and Nijaz Bajgoric and Ali Tamer {\"U}nal and Burak Birg{\"o}ren} } @article {866098, title = {{Some aspects of using CASE tools in a Fusion-based application development project for production optimization}}, journal = {Industrial Management and Data Systems}, volume = {102}, year = {2002}, pages = {463{\textendash}471}, doi = {10.1108/02635570210445899}, author = {Nijaz Bajgoric and I. Kuban Altinel and Murat Draman and Ali Tamer {\"U}nal} } @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 {1485, title = {Endogenising emission taxes: A general equilibrium type optimisation model applied for Turkey}, journal = {Energy Policy}, volume = {29}, year = {2001}, pages = {1045-1056}, abstract = {

This paper presents a modelling attempt to endogenise the level and timing of environmental taxes within an optimisation framework. First, a base model of energy{\textendash}economy{\textendash}environmental interactions is extended to allow for exogenous tax analysis. Two types of environmental taxes, one on the sulphur content of fuels and the other on the level of emissions, are exogenously included in the model as alternative instruments to mitigate pollution. Next, the base model is modified to endogenise pollution abatement. This has been achieved by incorporating a preference rate, depending on an index of emissions, into the utility function. Finally, the emission index and emission tax are taken as substitutes and modelled within a CES form to endogenise the emission tax. Results for all cases, obtained with Turkish data, are discussed. It is found that a tax on SO2 emissions is more effective in reducing SO2 emissions than a tax applied on the sulphur content of fuels. It is also found that a gradually increasing tax is more effective in reducing emissions than a constant tax.

}, keywords = {Emission taxation, Endogenous pollution abatement, Energy{\textendash}economy modelling}, issn = {0301-4215}, doi = {https://doi.org/10.1016/S0301-4215(01)00032-5}, url = {https://www.sciencedirect.com/science/article/pii/S0301421501000325}, author = {Y{\i}ld{\i}z Ar{\i}kan and G{\"u}rkan Kumbaro{\u g}lu} } @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} } @conference {2482925, title = {{Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project}}, booktitle = {Technology of Object-Oriented Languages and Systems}, year = {1999}, pages = {424{\textendash}427}, doi = {10.1109/TOOLS.1999.796516}, author = {Nijaz Bajgoric and I. Kuban Altinel and Murat Draman and Ali Tamer {\"U}nal} } @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 {26063414, title = {{A dynamic model for component testing}}, journal = {Naval Research Logistics}, volume = {44}, year = {1997}, pages = {187{\textendash}197}, doi = {10.1002/(SICI)1520-6750(199703)44:2<187::AID-NAV3>3.0.CO;2-5}, author = {I. Kuban Altinel} } @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 {14443126, title = {{Parametric distance functions vs. nonparametric neural networks for estimating road travel distances}}, journal = {European Journal of Operational Research}, volume = {93}, year = {1996}, pages = {230{\textendash}243}, doi = {10.1016/0377-2217(96)00045-8}, author = {Ethem Alpaydin and I. Kuban Altinel 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} } @article {14442391, title = {{The design of optimum component test plans in the demonstration of system reliability}}, journal = {European Journal of Operational Research}, volume = {78}, year = {1994}, pages = {318{\textendash}333}, doi = {10.1016/0377-2217(94)90043-4}, author = {I. Kuban Altinel} } @conference {Afflerbach;Hoermann:1992a, title = {Nonuniform random numbers: A sensitivity analysis for transformation methods}, booktitle = {Lecture Notes in Econom. Math. Systems}, series = {Lect. Notes Econ. Math. Syst.}, volume = {374}, year = {1992}, note = {Proc. Int. Workshop Comput. Intensive Methods Simulation Optimization, Laxenburg/Austria 1990}, pages = {135{\textendash}144}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {New York}, abstract = {

-?-

}, keywords = {-?-}, author = {Afflerbach, Lothar and Wolfgang H{\"o}rmann} }