Temel Öncan

MaRDI QIDQ319039zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph European Journal of Operational Research	2026-09-07	Paper
A branch-and-bound algorithm for the maximum weight perfect matching problem with conflicting edge pairs	2025-10-30	Paper
An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints European Journal of Operational Research	2025-05-20	Paper
Solving a minisum single facility location problem in three regions with different norms Annals of Operations Research	2023-06-20	Paper
A Survey of the Generalized Assignment Problem and Its Applications INFOR: Information Systems and Operational Research	2023-05-09	Paper
An Empirical Investigation of Four Well-Known Polynomial-Size VRP Formulations	2018-09-29	Paper
A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints	2018-04-11	Paper
An Empirical Investigation of Four Well-Known Polynomial-Size VRP Formulations (available as arXiv preprint)	2018-01-01	Paper
A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem Operations Research Proceedings	2017-12-01	Paper
The minimum cost perfect matching problem with conflict pair constraints Computers & Operations Research	2016-11-14	Paper
Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems Computers & Operations Research	2016-11-10	Paper
MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem European Journal of Operational Research	2016-10-06	Paper
The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm Computers & Operations Research	2010-06-11	Paper
Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem The Journal of the Operational Research Society	2009-08-28	Paper
VLSN search algorithms for partitioning problems using matching neighbourhoods The Journal of the Operational Research Society	2008-07-29	Paper
A tabu search heuristic for the generalized minimum spanning tree problem European Journal of Operational Research	2008-07-21	Paper
Design of unidirectional cyclic layouts International Journal of Production Research	2005-10-27	Paper
A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem The Journal of the Operational Research Society	2005-09-01	Paper

Research outcomes over time

This page was built for person: Temel Öncan