Temel Öncan

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 8

Top Topics

Search Heuristics

Branch And Bound

Top Venues

Ann. Oper. Res.

Comput. Oper. Res.

Int. J. Prod. Res.

Publications

Gökhan Altay, M. Hakan Akyüz, Temel Öncan
Solving a minisum single facility location problem in three regions with different norms. Ann. Oper. Res. 321 (1) (2023)
M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
Maximum weight perfect matching problem with additional disjunctive conflict constraints. Networks 81 (4) (2023)
Ufuk Bahçeci, Temel Öncan
An evaluation of several combinations of routing and storage location assignment policies for the order batching problem. Int. J. Prod. Res. 60 (19) (2022)
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) (2019)
Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel
Assignment problem with conflicts. Comput. Oper. Res. 111 (2019)
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)
Volkan Yildirim, M. Ebru Angun, Temel Öncan
An MILP Model for the Internal Audit Scheduling Problem. IEEM (2018)
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 (2018)
Osman Karpuzoglu, M. Hakan Akyüz, Temel Öncan
A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem. OR (2015)
Temel Öncan
MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem. Eur. J. Oper. Res. 243 (1) (2015)
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) (2014)
Temel Öncan
Heuristics for the single source capacitated multi-facility Weber problem. Comput. Ind. Eng. 64 (4) (2013)
Temel Öncan, Ruonan Zhang, Abraham P. Punnen
The minimum cost perfect matching problem with conflict pair constraints. Comput. Oper. Res. 40 (4) (2013)
Temel Öncan, Merve Cagirici
MILP Formulations for the Order Batching Problem in Low-Level Picker-To-Part Warehouse Systems. MIM (2013)
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) (2013)
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) (2012)
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) (2012)
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) (2012)
Temel Öncan, Dilek Tuzun Aksu, Güvenç Sahin, Mustafa Sahin
A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads. IEEM (2011)
Temel Öncan, Abraham P. Punnen
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. Comput. Oper. Res. 37 (10) (2010)
Volkan Çinar, Temel Öncan, Haldun Süral
A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves. EvoApplications (2) (2010)
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) (2009)
Temel Öncan, I. Kuban Altinel, Gilbert Laporte
A comparative analysis of several asymmetric traveling salesman problem formulations. Comput. Oper. Res. 36 (3) (2009)
Temel Öncan, Jean-François Cordeau, Gilbert Laporte
A tabu search heuristic for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 191 (2) (2008)
Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen
VLSN search algorithms for partitioning problems using matching neighbourhoods. J. Oper. Res. Soc. 59 (3) (2008)
Temel Öncan, I. Kuban Altinel
Exact solution procedures for the balanced unidirectional cyclic layout problem. Eur. J. Oper. Res. 189 (3) (2008)
Temel Öncan
Design of capacitated minimum spanning tree with uncertain cost and demand parameters. Inf. Sci. 177 (20) (2007)
Temel Öncan
A Survey of the Generalized Assignment Problem and Its Applications. INFOR Inf. Syst. Oper. Res. 45 (3) (2007)
Yasemin Claire Erensal, Temel Öncan, Murat Levent Demircan
Determining key capabilities in technology management using fuzzy analytic hierarchy process: A case study of Turkey. Inf. Sci. 176 (18) (2006)
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) (2005)