Temel Öncan

According to our database, Temel Öncan authored at least 30 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Maximum weight perfect matching problem with additional disjunctive conflict constraints.

M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan

Networks, June, 2023

Solving a minisum single facility location problem in three regions with different norms.

Gökhan Altay, M. Hakan Akyüz, Temel Öncan

Ann. Oper. Res., February, 2023

2022

An evaluation of several combinations of routing and storage location assignment policies for the order batching problem.

Ufuk Bahçeci, Temel Öncan

Int. J. Prod. Res., 2022

2019

Assignment problem with conflicts.

Temel Öncan, Zeynep Suvak, M. Hakan Akyüz, I. Kuban Altinel

Comput. Oper. Res., 2019

Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Ann. Oper. Res., 2019

A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.

Temel Öncan, M. Hakan Akyüz, I. Kuban Altinel

Proceedings of the 9th International Network Optimization Conference, 2019

2018

A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints.

Temel Öncan, I. Kuban Altinel

Electron. Notes Discret. Math., 2018

An MILP Model for the Internal Audit Scheduling Problem.

Volkan Yildirim, M. Ebru Angun, Temel Öncan

Proceedings of the 2018 IEEE International Conference on Industrial Engineering and Engineering Management, 2018

2015

MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem.

Temel Öncan

Eur. J. Oper. Res., 2015

A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem.

Osman Karpuzoglu, M. Hakan Akyüz, Temel Öncan

Proceedings of the Operations Research Proceedings 2015, 2015

2014

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.

M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan

Ann. Oper. Res., 2014

2013

The minimum cost perfect matching problem with conflict pair constraints.

Temel Öncan, Ruonan Zhang, Abraham P. Punnen

Comput. Oper. Res., 2013

Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Comput. Oper. Res., 2013

Heuristics for the single source capacitated multi-facility Weber problem.

Temel Öncan

Comput. Ind. Eng., 2013

MILP Formulations for the Order Batching Problem in Low-Level Picker-To-Part Warehouse Systems.

Temel Öncan, Merve Cagirici

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012

An evolutionary approach for tuning parametric Esau and Williams heuristics.

Maria Battarra, Temel Öncan, I. Kuban Altinel, Bruce L. Golden, Daniele Vigo, E. Phillips

J. Oper. Res. Soc., 2012

Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

J. Oper. Res. Soc., 2012

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.

M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel

Comput. Oper. Res., 2012

2011

A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads.

Temel Öncan, Dilek Tuzun Aksu, Güvenç Sahin, Mustafa Sahin

Proceedings of the 2011 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2011

2010

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.

Temel Öncan, Abraham P. Punnen

Comput. Oper. Res., 2010

A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves.

Volkan Çinar, Temel Öncan, Haldun Süral

Proceedings of the Applications of Evolutionary Computation, 2010

2009

Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem.

Temel Öncan, I. Kuban Altinel

J. Oper. Res. Soc., 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.

Temel Öncan, I. Kuban Altinel, Gilbert Laporte

Comput. Oper. Res., 2009

2008

VLSN search algorithms for partitioning problems using matching neighbourhoods.

Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen

J. Oper. Res. Soc., 2008

A tabu search heuristic for the generalized minimum spanning tree problem.

Temel Öncan, Jean-François Cordeau, Gilbert Laporte

Eur. J. Oper. Res., 2008

Exact solution procedures for the balanced unidirectional cyclic layout problem.

Temel Öncan, I. Kuban Altinel

Eur. J. Oper. Res., 2008

2007

Design of capacitated minimum spanning tree with uncertain cost and demand parameters.

Temel Öncan

Inf. Sci., 2007

A Survey of the Generalized Assignment Problem and Its Applications.

Temel Öncan

INFOR Inf. Syst. Oper. Res., 2007

2006

Determining key capabilities in technology management using fuzzy analytic hierarchy process: A case study of Turkey.

Yasemin Claire Erensal, Temel Öncan, Murat Levent Demircan

Inf. Sci., 2006

2005

A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem.

I. Kuban Altinel, Temel Öncan

J. Oper. Res. Soc., 2005