A multicommodity flow problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1974 English Publisher:WileyJournal:Networks, volume 4, pages 267-280 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: E. Kant;

doi: 10.1002/net.3230040306

A multicommodity flow problem

- Summary
- Subjects
- Metrics

Abstract

AbstractThis paper presents an algorithm for finding maximal sized sets of flows in a certain class of multicommodity flow networks. The class consists of networks with integer capacity edges and with each node being a source or sink for all but at most one commodity. This new procedure lifts a restriction in a previous algorithm that required flow in edges joining source and sink of the same commodity.

Related Organizations

Stanford University
United States

Keywords

Deterministic network models in operations research, Programming involving graphs or networks

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average