# Temel Öncan

According to our database

Collaborative distances:

^{1}, Temel Öncan authored at least 27 papers between 2005 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Comput. Oper. Res., 2019

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

Ann. Oper. Res., 2019

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

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.

Electron. Notes Discret. Math., 2018

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.

Eur. J. Oper. Res., 2015

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

Proceedings of the Operations Research Proceedings 2015, 2015

2014

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

Ann. Oper. Res., 2014

2013

Comput. Oper. Res., 2013

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

Comput. Oper. Res., 2013

Comput. Ind. Eng., 2013

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

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

2012

J. Oper. Res. Soc., 2012

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

J. Oper. Res. Soc., 2012

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

Comput. Oper. Res., 2012

2011

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

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.

Comput. Oper. Res., 2010

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

Proceedings of the Applications of Evolutionary Computation, 2010

2009

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

J. Oper. Res. Soc., 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.

Comput. Oper. Res., 2009

2008

J. Oper. Res. Soc., 2008

Eur. J. Oper. Res., 2008

Eur. J. Oper. Res., 2008

2007

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

Inf. Sci., 2007

INFOR Inf. Syst. Oper. Res., 2007

2006

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

Inf. Sci., 2006

2005

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

J. Oper. Res. Soc., 2005