@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 {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 {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 {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 {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 {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} } @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 {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} } @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 {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} } @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 {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 {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 {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} } @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 {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 {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} } @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} } @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 {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} } @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 {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} } @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 {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} } @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 {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 {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} }