Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets

• Sune Lauth Gadegaard

  Corresponding Author

  Sune Lauth Gadegaard

  http://orcid.org/0000-0001-8989-6015

  Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, DK-8210 Aarhus V, Denmark;

  Search for more papers by this author

  ,
• Lars Relund Nielsen

  Lars Relund Nielsen

  http://orcid.org/0000-0002-4802-3071

  Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, DK-8210 Aarhus V, Denmark;

  Search for more papers by this author

  ,
• Matthias Ehrgott

  Corresponding Author

  Matthias Ehrgott

  http://orcid.org/0000-0003-4648-4066

  Department of Management Science, Lancaster University, Lancaster LA1 4YX, United Kingdom

  Search for more papers by this author