Please use this identifier to cite or link to this item:
Freling, Richard
Romeijn, H. Edwin
Morales, Dolores Romero
Wagelmans, Albert P.M.
Year of Publication: 
Series/Report no.: 
Tinbergen Institute Discussion Paper 99-092/4
In this paper we propose a Branch and Price algorithm for solving multi-periodsingle-sourcing problems. In particular, we generalize a Branch and Price algorithm thatwas developed for the Generalized Assignment Problem (GAP) to a class of convexassignment problems. We then identify an important subclass of problems, containing manyvariants of the multi-period single-sourcing problem (MPSSP), as well as variants of theGAP, for which we derive an efficient solution procedure for the pricing problem, acritical factor in the efficiency of the Branch and Price algorithm. We execute anextensive numerical comparison between the performances of the Branch and Price algorithmand the MIP solver of CPLEX for a particular variant of the MPSSP.
Document Type: 
Working Paper

Files in This Item:
443 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.