Temel Öncan

1.4k total citations
36 papers, 958 citations indexed

About

Temel Öncan is a scholar working on Industrial and Manufacturing Engineering, Building and Construction and Computational Theory and Mathematics. According to data from OpenAlex, Temel Öncan has authored 36 papers receiving a total of 958 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Industrial and Manufacturing Engineering, 11 papers in Building and Construction and 7 papers in Computational Theory and Mathematics. Recurrent topics in Temel Öncan's work include Vehicle Routing Optimization Methods (26 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Optimization and Packing Problems (11 papers). Temel Öncan is often cited by papers focused on Vehicle Routing Optimization Methods (26 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Optimization and Packing Problems (11 papers). Temel Öncan collaborates with scholars based in Türkiye, Canada and Netherlands. Temel Öncan's co-authors include İ. Kuban Altınel, Murat Levent Demircan, Yasemin Claire Erensal, Gilbert Laporte, İbrahim Muter, Abraham P. Punnen, Ruonan Zhang, Jean‐François Cordeau, Güvenç Şahin and Dilek Tüzün Aksu and has published in prestigious journals such as European Journal of Operational Research, Information Sciences and Journal of the Operational Research Society.

In The Last Decade

Temel Öncan

34 papers receiving 914 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Temel Öncan Türkiye 15 618 182 164 144 114 36 958
Pasquale Avella Italy 17 582 0.9× 138 0.8× 134 0.8× 127 0.9× 298 2.6× 37 817
Wolfgang Domschke Germany 14 860 1.4× 172 0.9× 98 0.6× 147 1.0× 117 1.0× 38 1.1k
Raca Todosijević France 23 763 1.2× 155 0.9× 97 0.6× 124 0.9× 261 2.3× 58 1.0k
J. Marcos Moreno‐Vega Spain 20 868 1.4× 222 1.2× 87 0.5× 91 0.6× 159 1.4× 52 1.3k
Aziz Moukrim France 18 967 1.6× 121 0.7× 223 1.4× 131 0.9× 38 0.3× 69 1.2k
Jordi Pereira Chile 21 1.0k 1.6× 83 0.5× 147 0.9× 79 0.5× 88 0.8× 52 1.3k
Burak Ekşioğlu United States 17 757 1.2× 252 1.4× 92 0.6× 135 0.9× 104 0.9× 49 1.4k
Aldy Gunawan Singapore 19 753 1.2× 263 1.4× 155 0.9× 178 1.2× 70 0.6× 65 1.2k
Saïd Hanafi France 23 1.1k 1.7× 165 0.9× 95 0.6× 363 2.5× 145 1.3× 90 1.5k
Ada Álvarez Mexico 17 482 0.8× 82 0.5× 72 0.4× 67 0.5× 67 0.6× 42 720

Countries citing papers authored by Temel Öncan

Since Specialization
Citations

This map shows the geographic impact of Temel Öncan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Temel Öncan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Temel Öncan more than expected).

Fields of papers citing papers by Temel Öncan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Temel Öncan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Temel Öncan. The network helps show where Temel Öncan may publish in the future.

Co-authorship network of co-authors of Temel Öncan

This figure shows the co-authorship network connecting the top 25 collaborators of Temel Öncan. A scholar is included among the top collaborators of Temel Öncan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Temel Öncan. Temel Öncan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Öncan, Temel, et al.. (2025). An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints. European Journal of Operational Research. 324(2). 398–413.
2.
Aras, Necati, et al.. (2025). Solving the joint order batching and picker routeing selection problem in warehouses. International Journal of Production Research. 64(4). 1269–1294.
3.
Altınel, İ. Kuban, et al.. (2022). Maximum weight perfect matching problem with additional disjunctive conflict constraints. Networks. 81(4). 465–489. 1 indexed citations
4.
Öncan, Temel, et al.. (2021). An evaluation of several combinations of routing and storage location assignment policies for the order batching problem. International Journal of Production Research. 60(19). 5892–5911. 5 indexed citations
5.
Öncan, Temel, et al.. (2019). Assignment problem with conflicts. Computers & Operations Research. 111. 214–229. 12 indexed citations
6.
Öncan, Temel & İ. Kuban Altınel. (2018). A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electronic Notes in Discrete Mathematics. 64. 5–14. 7 indexed citations
7.
Muter, İbrahim & Temel Öncan. (2015). An exact solution approach for the order batching problem. IIE Transactions. 47(7). 728–738. 32 indexed citations
8.
Öncan, Temel, et al.. (2013). MILP Formulations for the Order Batching Problem in Low-Level Picker-to-Part Warehouse Systems. IFAC Proceedings Volumes. 46(9). 471–476. 9 indexed citations
9.
Öncan, Temel, et al.. (2013). Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems. Computers & Operations Research. 40(12). 3056–3068. 10 indexed citations
10.
Öncan, Temel. (2013). Heuristics for the single source capacitated multi-facility Weber problem. Computers & Industrial Engineering. 64(4). 959–971. 10 indexed citations
11.
Altınel, İ. Kuban, et al.. (2012). Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem. Annals of Operations Research. 222(1). 45–71. 14 indexed citations
12.
Şahın, Mustafa Ergin, et al.. (2012). An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads. Transportation Research Part C Emerging Technologies. 27. 169–188. 31 indexed citations
13.
Öncan, Temel, et al.. (2011). Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm. Journal of the Operational Research Society. 63(6). 771–789. 7 indexed citations
14.
Öncan, Temel, et al.. (2011). A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads. 50. 1864–1868. 3 indexed citations
15.
Öncan, Temel, et al.. (2011). Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Computers & Operations Research. 39(2). 225–237. 16 indexed citations
16.
Öncan, Temel, et al.. (2010). The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals. IIE Transactions. 42(11). 825–841. 11 indexed citations
17.
Öncan, Temel & Abraham P. Punnen. (2010). The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. Computers & Operations Research. 37(10). 1762–1773. 32 indexed citations
18.
Öncan, Temel. (2007). A Survey of the Generalized Assignment Problem and Its Applications. INFOR Information Systems and Operational Research. 45(3). 123–141. 36 indexed citations
19.
Öncan, Temel, İ. Kuban Altınel, & Gilbert Laporte. (2007). A comparative analysis of several asymmetric traveling salesman problem formulations. Computers & Operations Research. 36(3). 637–654. 151 indexed citations
20.
Öncan, Temel, et al.. (2007). VLSN search algorithms for partitioning problems using matching neighbourhoods. Journal of the Operational Research Society. 59(3). 388–398. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026