A branch and price algorithm for the multi-period single-sourcing problem
AbstractIn this paper we propose a Branch and Price algorithm for solving multi-period single-sourcing problems. In particular, we generalize a Branch and Price algorithm that was developed for the Generalized Assignment Problem (GAP) to a class of convex assignment problems. We then identify an important subclass of problems, containing many variants of the multi-period single-sourcing problem (MPSSP), as well as variants of the GAP, for which we derive an efficient solution procedure for the pricing problem, a critical factor in the efficiency of the Branch and Price algorithm. We execute an extensive numerical comparison between the performances of the Branch and Price algorithm and the MIP solver of CPLEX for a particular variant of the MPSSP.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 9941-/A.
Date of creation: 09 Nov 1999
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
networks; integer programming;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Romeijn, H.E. & Romero Morales, D., 2000. "A Greedy Heuristic for a Three-Level Multi-Period Single-Sourcing Problem," Research Paper ERS-2000-04-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus Uni.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.