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 (2017) 262(3) (908–928), (S0377221717304083), (10.1016/j.ejor.2017.04.061))

Luis Gouveia, Markus Leitner, Mario Ruthmair*, Ruslan Sadykov

*Corresponding author for this work

Research output: Contribution to JournalComment / Letter to the editorAcademic

Abstract

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.

Original languageEnglish
Pages (from-to)1199-1203
Number of pages5
JournalEuropean Journal of Operational Research
Volume285
Issue number3
Early online date9 Mar 2020
DOIs
Publication statusE-pub ahead of print - 9 Mar 2020

Fingerprint Dive into the research topics of '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 (2017) 262(3) (908–928), (S0377221717304083), (10.1016/j.ejor.2017.04.061))'. Together they form a unique fingerprint.

  • Cite this