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

von Öncan, Temel
Veröffentlicht in European journal of operational research (2015)

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

von Öncan, Temel
Veröffentlicht in Computers & operations research (2010)

A comparative analysis of several asymmetric traveling salesman problem formulations

von Öncan, Temel
Veröffentlicht in Computers & operations research (2009)

Efficent lower and upper bounds for the multi-commodity capacitated multi-facility Weber problem with rectilinear distances

von Akyüz, M.Hakan
Veröffentlicht in Logistik-Management (2009)

The minimum cost perfect matching problem with conflict pair constraints

von Öncan, Temel
Veröffentlicht in Computers & operations research (2013)

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

von Akyüz, M. Hakan
Veröffentlicht in Computers & operations research (2012)

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

von Akyüz, M. Hakan
Veröffentlicht in ORP3 Conference (5. : 2011 : Cádiz) ORP 3 - OR for young researchers and practitioners (2014)

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

von Akyüz, M. Hakan
Veröffentlicht in Computers & operations research (2013)

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

von Akyüz, M. Hakan
Veröffentlicht in Annals of operations research ; volume 279, numbers 1/2 (August 2019) (2019)

Assignment problem with conflicts

von Öncan, Temel
Veröffentlicht in Computers & operations research (2019)