Scandinavian Working Papers in Business Administration
CORAL Working Papers,
University of Aarhus, Aarhus School of Business, Department of Business Studies
No L-2006-08: Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
Eduardo Uchoa (), Ricardo Fukasawa (), Jens Lysgaard, Artur Pessoa (), Marcus Poggi de Aragão () and Diogo Andrade ()
Additional contact information
Eduardo Uchoa: Departamento de Engenharia de Producão, Postal: Universidade Federal Fluminense, Brazil
Ricardo Fukasawa: School of Industrial and Systems Engineering, Postal: GeorgiaTech, USA
Jens Lysgaard: Department of Accounting, Aarhus School of Business, Postal: The Aarhus School of Business, Fuglesangs Allé 4, 8210 Aarhus V, Denmark
Artur Pessoa: Departamento de Engenharia de Producão, Postal: Universidade Federal Fluminense, Brazil
Marcus Poggi de Aragão: Departamento de Informática, Postal: PUC, Rio de Janeiro, Brazil
Diogo Andrade: RUTCOR, Postal: Rutgers University, USA
Abstract: 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 arbores- cence 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 signi¯cant improvements over previous algorithms. Several open instances could be solved to optimality
Keywords: No keywords
34 pages, May 1, 2006
Full text files
L_2006_08.pdf
- University of Aarhus, Aarhus School of Business, Department of Business Studies
- Home page for this series
Questions (including download problems) about the papers in this series should be directed to Helle Vinbaek Stenholt ()
Report other problems with accessing this service to Sune Karlsson ().
This page generated on 2024-02-05 17:10:04.