Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/85464 
Erscheinungsjahr: 
1999
Schriftenreihe/Nr.: 
Tinbergen Institute Discussion Paper No. 99-092/4
Verlag: 
Tinbergen Institute, Amsterdam and Rotterdam
Zusammenfassung: 
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.
Dokumentart: 
Working Paper
Erscheint in der Sammlung:

Datei(en):
Datei
Größe
443 kB





Publikationen in EconStor sind urheberrechtlich geschützt.