Temel Öncan

发表

An MILP Model for the Internal Audit Scheduling Problem

Volkan Yildirim, M. Ebru Angun, Temel Öncan, 2018, 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2018, Ann. Oper. Res..

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

Temel Öncan, I. Kuban Altinel, T. Öncan, 2009, J. Oper. Res. Soc..

Exact solution procedures for the balanced unidirectional cyclic layout problem

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2008, Eur. J. Oper. Res..

A Survey of the Generalized Assignment Problem and Its Applications

Temel Öncan, T. Öncan, 2007, INFOR Inf. Syst. Oper. Res..

A tabu search heuristic for the generalized minimum spanning tree problem

Temel Öncan, Gilbert Laporte, Jean-François Cordeau, 2008, Eur. J. Oper. Res..

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2013, Computers & Operations Research.

A comparative analysis of several asymmetric traveling salesman problem formulations

Temel Öncan, Gilbert Laporte, I. K. Altinel, 2009, Comput. Oper. Res..

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

Temel Öncan, Yasemin Claire Erensal, Murat Levent Demircan, 2006, Inf. Sci..

VLSN search algorithms for partitioning problems using matching neighbourhoods

Temel Öncan, Abraham P. Punnen, Kunhiraman Nair, 2008, J. Oper. Res. Soc..

Efficient Lower and Upper Bounds for the Multi-commodity Capacitated Multi-facility Weber Problem with Rectilinear Distances

Temel Öncan, M. Hakan Akyüz, I. Kuban Altınel, 2009 .

An evolutionary approach for tuning parametric Esau and Williams heuristics

Daniele Vigo, Temel Öncan, I. K. Altinel, 2012, J. Oper. Res. Soc..

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

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

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

Temel Öncan, T. Öncan, 2007, Inf. Sci..

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

Temel Öncan, Haldun Süral, Volkan Çinar, 2010, EvoApplications.

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2012, Comput. Oper. Res..

A Review and Comparative Analysis of Several Asymmetric Travelling Salesman Problem Formulations

Temel Öncan, Gilbert Laporte, I. Kuban Altınel, 2006 .

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

Temel Öncan, I. Kuban Altinel, 2018, Electron. Notes Discret. Math..

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

Temel Öncan, T. Öncan, 2015, Eur. J. Oper. Res..

Heuristics for the single source capacitated multi-facility Weber problem

Temel Öncan, 2013, Comput. Ind. Eng..

Assignment problem with conflicts

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2019, Comput. Oper. Res..

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2014, Ann. Oper. Res..

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

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

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

Temel Öncan, Güvenç Sahin, Dilek Tuzun Aksu, 2011, 2011 IEEE International Conference on Industrial Engineering and Engineering Management.

The minimum cost perfect matching problem with conflict pair constraints

Temel Öncan, Abraham P. Punnen, Ruonan Zhang, 2013, Comput. Oper. Res..

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2012, J. Oper. Res. Soc..

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

Temel Öncan, Abraham P. Punnen, 2010, Comput. Oper. Res..

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2005, J. Oper. Res. Soc..

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

Temel Öncan, Merve Cagirici, 2013, MIM.

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

Temel Öncan, Ufuk Bahçeci, Ufuk Bahçeci, 2021, Int. J. Prod. Res..

Order batching and picker scheduling in warehouse order picking

Temel Öncan, İbrahim Muter, 2021 .

An exact solution approach for the order batching problem

Temel Öncan, İbrahim Muter, I. Muter, 2015 .

A Genetic Algorithm for the Order Batching Problem in Low-Level Picker-to-Part Warehouse Systems

Temel Öncan, 2013 .

The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals

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