Temel Öncan

32 papers C 1Journal 26Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Solving the joint order batching and picker routeing selection problem in warehouses.
Int. J. Prod. Res.
Ozan Ridvan Aksu, Necati Aras, Temel Öncan
2025 J jnl
An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints.
Eur. J. Oper. Res.
Bahadir Pamuk, Temel Öncan, I. Kuban Altinel
2023 J jnl
Maximum weight perfect matching problem with additional disjunctive conflict constraints.
Networks
M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
2023 J jnl
Solving a minisum single facility location problem in three regions with different norms.
Ann. Oper. Res.
Gökhan Altay, M. Hakan Akyüz, Temel Öncan
2022 J jnl
An evaluation of several combinations of routing and storage location assignment policies for the order batching problem.
Int. J. Prod. Res.
Ufuk Bahçeci, Temel Öncan
2019 C conf
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
INOC
Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel
2019 J jnl
Assignment problem with conflicts.
Comput. Oper. Res.
Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel
2019 J jnl
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.
Ann. Oper. Res.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2018 J jnl
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints.
Electron. Notes Discret. Math.
Temel Öncan, I. Kuban Altinel
2018 — conf
An MILP Model for the Internal Audit Scheduling Problem.
IEEM
Volkan Yildirim, M. Ebru Angun, Temel Öncan
2015 — conf
A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem.
OR
Osman Karpuzoglu, M. Hakan Akyüz, Temel Öncan
2015 J jnl
MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem.
Eur. J. Oper. Res.
Temel Öncan
2014 J jnl
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.
Ann. Oper. Res.
M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan
2013 J jnl
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.
Comput. Oper. Res.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2013 J jnl
Heuristics for the single source capacitated multi-facility Weber problem.
Comput. Ind. Eng.
Temel Öncan
2013 — conf
MILP Formulations for the Order Batching Problem in Low-Level Picker-To-Part Warehouse Systems.
MIM
Temel Öncan, Merve Cagirici
2013 J jnl
The minimum cost perfect matching problem with conflict pair constraints.
Comput. Oper. Res.
Temel Öncan, Ruonan Zhang, Abraham P. Punnen
2012 J jnl
An evolutionary approach for tuning parametric Esau and Williams heuristics.
J. Oper. Res. Soc.
Maria Battarra, Temel Öncan, I. Kuban Altinel, Bruce L. Golden, Daniele Vigo, E. Phillips
2012 J jnl
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.
Comput. Oper. Res.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2012 J jnl
Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm.
J. Oper. Res. Soc.
M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel
2011 — conf
A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads.
IEEM
Temel Öncan, Dilek Tuzun Aksu, Güvenç Sahin, Mustafa Sahin
2010 — conf
A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves.
EvoApplications (2)
Volkan Çinar, Temel Öncan, Haldun Süral
2010 J jnl
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.
Comput. Oper. Res.
Temel Öncan, Abraham P. Punnen
2009 J jnl
A comparative analysis of several asymmetric traveling salesman problem formulations.
Comput. Oper. Res.
Temel Öncan, I. Kuban Altinel, Gilbert Laporte
2009 J jnl
Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem.
J. Oper. Res. Soc.
Temel Öncan, I. Kuban Altinel
2008 J jnl
A tabu search heuristic for the generalized minimum spanning tree problem.
Eur. J. Oper. Res.
Temel Öncan, Jean-François Cordeau, Gilbert Laporte
2008 J jnl
Exact solution procedures for the balanced unidirectional cyclic layout problem.
Eur. J. Oper. Res.
Temel Öncan, I. Kuban Altinel
2008 J jnl
VLSN search algorithms for partitioning problems using matching neighbourhoods.
J. Oper. Res. Soc.
Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen
2007 J jnl
A Survey of the Generalized Assignment Problem and Its Applications.
INFOR Inf. Syst. Oper. Res.
Temel Öncan
2007 J jnl
Design of capacitated minimum spanning tree with uncertain cost and demand parameters.
Inf. Sci.
Temel Öncan
2006 J jnl
Determining key capabilities in technology management using fuzzy analytic hierarchy process: A case study of Turkey.
Inf. Sci.
Yasemin Claire Erensal, Temel Öncan, Murat Levent Demircan
2005 J jnl
A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem.
J. Oper. Res. Soc.
I. Kuban Altinel, Temel Öncan