A branch and price algorithm for the multi-period single-sourcing problem
Abstract
In 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 Info
If 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 Info
Paper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI 9941-/A.Length:
Date of creation: 09 Nov 1999
Date of revision:
Handle: RePEc:dgr:eureir:1765001615
Contact details of provider:
Web page: http://www.few.eur.nl/few
Related research
Keywords: networks; integer programming;References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
- 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.
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:dgr:eureir:1765001615For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

