Aarhus University Seal / Aarhus Universitets segl

Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation

Research output: Working paperResearch

  • Eduardo Uchoa, Denmark
  • Ricardo Fukasawa, Denmark
  • Jens Lysgaard
  • Artur Pessoa, Denmark
  • Marcus Poggi de Aragão, Denmark
  • Diogo Andrade, Denmark
  • Department of Business Studies
  • CORAL - Centre for Operations Research Applications in Logistics
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arborescence problem in order to make it solvable in pseudo-polynomial time. Traditional inequalities over the arc formulation, like Capacity Cuts, are also used. Moreover, a novel feature is introduced in such kind of algorithms. Powerful new cuts expressed over a very large set of variables could be added, without increasing the complexity of the pricing subproblem or the size of the LPs that are actually solved. Computational results on benchmark instances from the OR-Library show very signicant improvements over previous algorithms. Several open instances could be solved to optimality.
Original languageEnglish
PublisherAarhus School of Business, Department of Business Studies
ISBN (Electronic)87-7882-130-4
Publication statusPublished - 2006

    Research areas

  • column generation, cutting planes, extended formul

See relations at Aarhus University Citationformats

ID: 32346300