Abstract
Typically the models described in the literature for multistage multicommodity distribution-systems assume, that features combining different commodities only occur in the objective. Therefore, in the case of linear or linearized distribution-system design problems the masterproblem decomposes into as many independent subproblems as there are different commodities. Therefore, each of these subproblems can be solved by known standard optimizing algorithms. Contrary to these assumptions real-life applications usually show a lot of constraints concerning two or more products. Frequently, each client has to be assigned to exactly one distribution center (single-source constraint) or there are capacitated resources at the facilities for production and throughput for all commodities or only subsets of the different commodities. Considering these constraints it’s no longer possible to solve the original master-problem as a sequence of independent one-product subproblems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Kindt, A. (1994). Multicommodity Network Flow Problems with Overlapping Capacities for Several Products. In: Operations Research Proceedings 1993. Operations Research Proceedings, vol 1993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78910-6_78
Download citation
DOI: https://doi.org/10.1007/978-3-642-78910-6_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57862-8
Online ISBN: 978-3-642-78910-6
eBook Packages: Springer Book Archive