default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDI. Kuban Altinel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j59]M. Hakan Akyüz
, I. Kuban Altinel, Temel Öncan:
Maximum weight perfect matching problem with additional disjunctive conflict constraints. Networks 81(4): 465-489 (2023)- 2022
- [j58]Kübra Taninmis, Necati Aras, I. Kuban Altinel:
Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. Eur. J. Oper. Res. 297(1): 40-52 (2022) - 2021
- [j57]Betül Ahat, Ahmet Cihat Baktir, Necati Aras, I. Kuban Altinel, Atay Özgövde, Cem Ersoy:
Optimal server and service deployment for multi-tier edge cloud computing. Comput. Networks 199: 108393 (2021) - [j56]Zeynep Suvak, I. Kuban Altinel, Necati Aras:
Minimum cost flow problem with conflicts. Networks 78(4): 421-442 (2021) - 2020
- [j55]Zeynep Suvak, I. Kuban Altinel, Necati Aras:
Exact solution algorithms for the maximum flow problem with additional conflict constraints. Eur. J. Oper. Res. 287(2): 410-437 (2020) - [j54]Kübra Taninmis, Necati Aras, I. Kuban Altinel, Evren Güney:
Minimizing the misinformation spread in social networks. IISE Trans. 52(8): 850-863 (2020)
2010 – 2019
- 2019
- [j53]M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel:
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem. Ann. Oper. Res. 279(1-2): 1-42 (2019) - [j52]Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel:
Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT). Comput. Oper. Res. 110: 1-17 (2019) - [j51]Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel:
Assignment problem with conflicts. Comput. Oper. Res. 111: 214-229 (2019) - [j50]I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin:
Minimum cost noncrossing flow problem on layered networks. Discret. Appl. Math. 261: 2-21 (2019) - [j49]Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel:
The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT). Eur. J. Oper. Res. 272(1): 372-388 (2019) - [j48]Baris Evrim Demiröz, I. Kuban Altinel, Lale Akarun:
Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms. Eur. J. Oper. Res. 277(1): 62-83 (2019) - [j47]Kübra Taninmis, Necati Aras, I. Kuban Altinel:
Influence maximization with deactivation in social networks. Eur. J. Oper. Res. 278(1): 105-119 (2019) - [c11]Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel:
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs. INOC 2019: 31-36 - [c10]Betül Ahat, Necati Aras, I. Kuban Altinel, Ahmet Cihat Baktir, Cem Ersoy:
Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks. OR 2019: 199-205 - [i3]Kübra Taninmis, Necati Aras, I. Kuban Altinel:
Influence Maximization With Deactivation In Social Networks. CoRR abs/1904.08628 (2019) - [i2]Baris Evrim Demiröz, I. Kuban Altinel, Lale Akarun:
Rectangle Blanket Problem: Binary integer linear programming formulation and solution algorithms. CoRR abs/1910.01193 (2019) - 2018
- [j46]Temel Öncan, I. Kuban Altinel:
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electron. Notes Discret. Math. 64: 5-14 (2018) - 2017
- [j45]Ezgi Karabulut, Necati Aras, I. Kuban Altinel:
Optimal sensor deployment to increase the security of the maximal breach path in border surveillance. Eur. J. Oper. Res. 259(1): 19-36 (2017) - 2016
- [j44]Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel:
Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur. J. Oper. Res. 254(3): 985-1001 (2016) - [j43]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy:
Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility. Int. J. Sens. Networks 20(3): 131-146 (2016) - [c9]Pinar Dursun, Z. Caner Taskin, I. Kuban Altinel:
Mathematical Models for Optimal Volumetric Modulated Arc Therapy (VMAT) Treatment Planning. CENTERIS/ProjMAN/HCist 2016: 644-651 - 2015
- [j42]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras:
Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks. Comput. Oper. Res. 59: 132-143 (2015) - [j41]Burak Kocuk, I. Kuban Altinel, Necati Aras:
Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction. Comput. Oper. Res. 64: 139-158 (2015) - [i1]Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras:
Minimum Cost Noncrossing Flow Problem on a Layered Network. CTW 2015: 129-132 - 2014
- [j40]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy:
Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility. Ad Hoc Networks 17: 18-36 (2014) - [j39]M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan:
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem. Ann. Oper. Res. 222(1): 45-71 (2014) - [j38]Yavuz Bogaç Türkogullari, Z. Caner Taskin, Necati Aras, I. Kuban Altinel:
Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 235(1): 88-101 (2014) - 2013
- [j37]M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel:
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems. Comput. Oper. Res. 40(12): 3056-3068 (2013) - 2012
- [j36]M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel:
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Comput. Oper. Res. 39(2): 225-237 (2012) - [j35]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A leader-follower game in competitive facility location. Comput. Oper. Res. 39(2): 437-448 (2012) - [j34]Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy:
Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. Comput. Oper. Res. 39(7): 1530-1539 (2012) - [j33]Maria Battarra, Temel Öncan, I. Kuban Altinel, Bruce L. Golden, Daniele Vigo, E. Phillips:
An evolutionary approach for tuning parametric Esau and Williams heuristics. J. Oper. Res. Soc. 63(3): 368-378 (2012) - [j32]M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel:
Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm. J. Oper. Res. Soc. 63(6): 771-789 (2012) - [c8]Necati Aras, Yavuz Bogaç Türkogullari, Z. Caner Taskin, I. Kuban Altinel:
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals. OR 2012: 101-107 - 2011
- [j31]I. Kuban Altinel, Bora Çekyay, Orhan Feyzioglu, Muhammed Emre Keskin, Süleyman Özekici:
Mission-Based Component Testing for Series Systems. Ann. Oper. Res. 186(1): 1-22 (2011) - [j30]Muhammed Emre Keskin, I. Kuban Altinel, Necati Aras, Cem Ersoy:
Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time. Comput. J. 54(12): 1987-1999 (2011) - [j29]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution. Eur. J. Oper. Res. 208(3): 206-220 (2011) - [j28]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A discrete competitive facility location model with variable attractiveness. J. Oper. Res. Soc. 62(9): 1726-1741 (2011) - [j27]I. Kuban Altinel, Necati Aras, Kerem Can Özkisacik:
Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem. J. Oper. Res. Soc. 62(10): 1813-1826 (2011) - 2010
- [j26]Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy:
An efficient heuristic for placement, scheduling and routing in wireless sensor networks. Ad Hoc Networks 8(6): 654-667 (2010) - [j25]Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy:
Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks. Comput. Networks 54(11): 1805-1822 (2010) - [j24]Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy:
A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks. Eur. J. Oper. Res. 207(2): 1014-1026 (2010) - [j23]Yavuz Bogaç Türkogullari, Necati Aras, I. Kuban Altinel, Cem Ersoy:
Optimal placement, scheduling, and routing to maximize lifetime in sensor networks. J. Oper. Res. Soc. 61(6): 1000-1012 (2010) - [c7]Evren Güney, I. Kuban Altinel, Necati Aras, Cem Ersoy:
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks. EvoCOP 2010: 83-94 - [c6]Hande Küçükaydin, Necati Aras, I. Kuban Altinel:
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model. Hybrid Metaheuristics 2010: 31-45
2000 – 2009
- 2009
- [j22]Temel Öncan, I. Kuban Altinel, Gilbert Laporte:
A comparative analysis of several asymmetric traveling salesman problem formulations. Comput. Oper. Res. 36(3): 637-654 (2009) - [j21]Engin Durmaz, Necati Aras, I. Kuban Altinel:
Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations. Comput. Oper. Res. 36(7): 2139-2148 (2009) - [j20]I. Kuban Altinel, Engin Durmaz, Necati Aras, Kerem Can Özkisacik:
A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations. Eur. J. Oper. Res. 198(3): 790-799 (2009) - [j19]Temel Öncan, I. Kuban Altinel:
Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem. J. Oper. Res. Soc. 60(2): 259-267 (2009) - [j18]Kerem Can Özkisacik, I. Kuban Altinel, Necati Aras:
Solving probabilistic multi-facility Weber problem by vector quantization. OR Spectr. 31(3): 533-554 (2009) - 2008
- [j17]I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy:
Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Comput. Networks 52(12): 2419-2431 (2008) - [j16]Orhan Feyzioglu, I. Kuban Altinel, Süleyman Özekici:
Optimum component test plans for phased-mission systems. Eur. J. Oper. Res. 185(1): 255-265 (2008) - [j15]Temel Öncan, I. Kuban Altinel:
Exact solution procedures for the balanced unidirectional cyclic layout problem. Eur. J. Oper. Res. 189(3): 609-623 (2008) - [j14]Necati Aras, M. Orbay, I. Kuban Altinel:
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. J. Oper. Res. Soc. 59(1): 64-79 (2008) - 2007
- [p1]Necati Aras, Sadettin Yumusak, I. Kuban Altinel:
Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms. Metaheuristics 2007: 91-112 - 2006
- [j13]Orhan Feyzioglu, I. Kuban Altinel, Süleyman Özekici:
The design of optimum component test plans for system reliability. Comput. Stat. Data Anal. 50(11): 3099-3112 (2006) - [j12]Necati Aras, Kerem Can Özkisacik, I. Kuban Altinel:
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps. J. Oper. Res. Soc. 57(1): 82-93 (2006) - [c5]I. Kuban Altinel, Necati Aras, Evren Güney, Cem Ersoy:
Effective coverage in sensor networks: Binary integer programming formulations and heuristics. ICC 2006: 4014-4019 - 2005
- [j11]I. Kuban Altinel, Temel Öncan:
A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J. Oper. Res. Soc. 56(8): 954-961 (2005) - 2003
- [j10]Necati Aras, I. Kuban Altinel, B. John Oommen:
A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE. IEEE Trans. Neural Networks 14(4): 869-890 (2003) - [c4]I. Kuban Altinel, Necati Aras, B. John Oommen:
A self-organizing method for map reconstruction. NNSP 2003: 677-687 - 2002
- [j9]Murat Draman, I. Kuban Altinel, Nijaz Bajgoric, Ali Tamer Ünal, Burak Birgören:
A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries. Eur. J. Oper. Res. 137(3): 483-496 (2002) - [j8]Nijaz Bajgoric, I. Kuban Altinel, Murat Draman, Ali Tamer Ünal:
Some aspects of using CASE tools in a Fusion-based application development project for production optimization. Ind. Manag. Data Syst. 102(8): 463-471 (2002) - [j7]I. Kuban Altinel, Süleyman Özekici, Orhan Feyzioglu:
Component testing of a series system in a random mission. Reliab. Eng. Syst. Saf. 78(1): 33-43 (2002) - 2001
- [j6]I. Kuban Altinel, Süleyman Özekici, Orhan Feyzioglu:
Component testing of repairable systems in multistage missions. J. Oper. Res. Soc. 52(8): 937-944 (2001) - 2000
- [j5]I. Kuban Altinel, Necati Aras, B. John Oommen:
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches. Comput. Oper. Res. 27(5): 461-494 (2000) - [c3]Necati Aras, I. Kuban Altinel, B. John Oommen:
A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE. ECAI 2000: 261-265
1990 – 1999
- 1999
- [j4]Necati Aras, B. John Oommen, I. Kuban Altinel:
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. Neural Networks 12(9): 1273-1284 (1999) - [c2]Nijaz Bajgoric, I. Kuban Altinel, Murat Draman, Ali Tamer Ünal:
Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project. TOOLS (31) 1999: 424-427 - 1998
- [j3]I. Kuban Altinel, Süleyman Özekici:
Optimum component test plans for systems with dependent components. Eur. J. Oper. Res. 111(1): 175-186 (1998) - [j2]B. John Oommen, I. Kuban Altinel, Necati Aras:
Discrete vector quantization for arbitrary distance function estimation. IEEE Trans. Syst. Man Cybern. Part B 28(4): 496-510 (1998) - 1997
- [j1]I. Kuban Altinel, B. John Oommen, Necati Aras:
Vector Quantization for Arbitrary Distance Function Estimation. INFORMS J. Comput. 9(4): 439-451 (1997) - 1995
- [c1]B. John Oommen, I. Kuban Altinel, Necati Aras:
Arbitrary distance function estimation using vector quantization. ICNN 1995: 3062-3067
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
