Instances

Spanning Tree Problem with Variable Degree Bounds

Benchmark instances can be downloaded here. For details we refer to

  • [PDF] [DOI] Luis Gouveia, Pedro Moura, Mario Ruthmair, and Amaro Sousa. Spanning Trees with Variable Degree Bounds. European Journal of Operational Research, 239(3):830–841, 2014.
    [Bibtex]
    @Article{Gouveia2014,
    Title = {Spanning Trees with Variable Degree Bounds},
    Author = {Gouveia, Luis and Moura, Pedro and Ruthmair, Mario and Sousa, Amaro},
    Journal = {European Journal of Operational Research},
    Year = {2014},
    Number = {3},
    Pages = {830--841},
    Volume = {239},
    Doi = {10.1016/j.ejor.2014.05.034},
    File = {:pdfs-own/Gouveia2014.pdf:PDF},
    Timestamp = {2015.05.23}
    }

Black-and-White Traveling Salesman Problem

Benchmark instances can be downloaded here. For details we refer to

  • [PDF] [DOI] Luis Gouveia, Markus Leitner, and Mario Ruthmair. Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem. European Journal of Operational Research, 262(3):908–928, 2017.
    [Bibtex]
    @Article{Gouveia2017,
    Title = {Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem},
    Author = {Gouveia, Luis and Leitner, Markus and Ruthmair, Mario},
    Journal = {European Journal of Operational Research},
    Year = {2017},
    Number = {3},
    Pages = {908--928},
    Volume = {262},
    Doi = {10.1016/j.ejor.2017.04.061},
    File = {:pdfs-own/Gouveia2017.pdf:PDF},
    Timestamp = {2017-06-163}
    }

Please contact me in case you have questions!