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]

Luis Gouveia; Markus Leitner; Mario Ruthmair; Ruslan Sadykov

doi:10.1016/j.ejor.2020.02.039

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]

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

^*Corresponding author for this work

Operations Analytics

Research output: Contribution to Journal › Erratum / Corrigendum › Academic

168 Downloads (Pure)

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 language	English
Pages (from-to)	1199-1203
Number of pages	5
Journal	European Journal of Operational Research
Volume	285
Issue number	3
Early online date	9 Mar 2020
DOIs	https://doi.org/10.1016/j.ejor.2020.02.039
Publication status	Published - 16 Sept 2020

Bibliographical note

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).

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 16 Peace, Justice and Strong Institutions

Access to Document

10.1016/j.ejor.2020.02.039

Corrigendum to_Extended Formulations and BranchandCut Algorithms for the BlackandWhite Traveling Salesman ProblemFinal published version, 245 KBLicence: Article 25fa Dutch Copyright Act

Persistent URL (handle)

Persistent link

Cite this

@article{555371f15af44212830b223a0661b17e,

title = "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]",

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.",

author = "Luis Gouveia and Markus Leitner and Mario Ruthmair and Ruslan Sadykov",

note = "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).",

year = "2020",

month = sep,

day = "16",

doi = "10.1016/j.ejor.2020.02.039",

language = "English",

volume = "285",

pages = "1199--1203",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

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]. / Gouveia, Luis; Leitner, Markus; Ruthmair, Mario et al.
In: European Journal of Operational Research, Vol. 285, No. 3, 16.09.2020, p. 1199-1203.

Research output: Contribution to Journal › Erratum / Corrigendum › Academic

TY - JOUR

T1 - 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]

AU - Gouveia, Luis

AU - Leitner, Markus

AU - Ruthmair, Mario

AU - Sadykov, Ruslan

N1 - 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).

PY - 2020/9/16

Y1 - 2020/9/16

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85081245242

UR - https://www.scopus.com/pages/publications/85081245242#tab=citedBy

U2 - 10.1016/j.ejor.2020.02.039

DO - 10.1016/j.ejor.2020.02.039

M3 - Erratum / Corrigendum

AN - SCOPUS:85081245242

SN - 0377-2217

VL - 285

SP - 1199

EP - 1203

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

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]

Abstract

Bibliographical note

UN SDGs

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this