• Graduate Programs
    • Tinbergen Institute Research Master in Economics
      • Why Tinbergen Institute?
      • Research Master
      • Admissions
      • Course Registration
      • Facilities
      • PhD Vacancies
      • Selected PhD Placements
    • Research Master Business Data Science
    • PhD Vacancies
  • Research
  • Browse our Courses
  • Events
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Gender in Society
      • Machine Learning for Business
      • Marketing Research with Purpose
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Events Calendar
    • Events Archive
    • Tinbergen Institute Lectures
    • 16th Tinbergen Institute Annual Conference
    • Annual Tinbergen Institute Conference
  • News
  • Alumni
    • PhD Theses
    • Master Theses
    • Selected PhD Placements
    • Key alumni publications
    • Alumni Community

Gouveia, L., Leitner, M., Ruthmair, M. and Sadykov, R. (2020). Corrigendum to “Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem” [European Journal of Operational Research, 262(3) 2017, 908–928] European Journal of Operational Research, 285(3):1199--1203.

  • Journal
    European Journal of Operational Research
View publication

In a personal communication with Ruslan Sadykov from Inria, France, we found an implementation error in our code for importing the benchmark instance set MUT leading to wrong numerical results in our original article (Gouveia, Leitner, and Ruthmair, 2017). In this corrigendum we provide corrected results for all experiments on instance set MUT. The general findings and conclusions drawn from the results however do not change.