Operations Research/Logistics, also in combination eith sustainability
Combinatorial optimization problems in routing and networks
Operations Research problems with an environmental or geographical component
M. Turkensteen, G. Sierksma, J.E. Wieringa, „Balancing the Fit and the Logistics Costs of Segmentations”, European Journal of Operational Research, In Press, Corrected Proof.
R. Germs, B. Goldengorin, M. Turkensteen, “Lower Tolerance-Based Branch and Bound Algorithms for the ATSP”, Computers & Operations Research 39 (2), 2012, 291-298.
M. Turkensteen, D. Ghosh, B. Goldengorin, G. Sierksma. “Tolerance-Based Branch and Bound Algorithms for the ATSP”. European Journal of Operational Research, 2008, 183(3), page 775-788.
M. Turkensteen, D. Ghosh, B. Goldengorin, G. Sierksma. “Iterative Patching and the Asymmetric Traveling Salesman Problem”. Discrete Optimization 2006, 3(1), 63 - 77.
PhD in Economics and Business at the University of Groningen, 2002-2006
MSc in Econometrics & OR at the University of Groningen, 1997-2002
Marcel Turkensteen’s research is within the field of Operations Research and Logistics. His field of interest is broad and contains interdisciplinary research.
The main areas of interest are:
- Network problems in routing and location. This includes the improvement of algorithms for difficult combinatorial problems, such as the Traveling Salesman Problem. Examples of this are the publications on the use of tolerances in optimization.
- The development of models and solution approach for problems with a geographical dimension. This dimension may be due to the spread of locations over a geographical area, or the influence of management decisions on the environment. A prime example of this is the paper on balancing the fit and logistics costs of market segmentations.
Publication: Research › Working paper
Publication: Research - peer-review › Journal article
Publication: Research › Article in proceedings