๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graphic matroids and the multicommodity transportation problem

โœ Scribed by James R. Evans; John J. Jarvis; Richard A. Duke

Publisher
Springer-Verlag
Year
1977
Tongue
English
Weight
262 KB
Volume
13
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graphic matroids, shellability and the P
Graphic matroids, shellability and the Poincare Conjecture
โœ Andrew Vince ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Springer ๐ŸŒ English โš– 610 KB

In this paper we introduce a theory of edge shelling of graphs. Whereas the standard notion of shelling a simplieial complex involves a sequential removal of maximal simplexes, edge shelling involves a sequential removal of the edges of a graph. A necessary and sufficient condition for edge shellabi

The bottleneck transportation problem
The bottleneck transportation problem
โœ R. S. Garfinkel; M. R. Rao ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 326 KB
Coding the transportation problem
Coding the transportation problem
โœ Stephen Glicksman; Lyle Johnson; Leonard Eselson ๐Ÿ“‚ Article ๐Ÿ“… 1960 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 794 KB

A new "pivotaltt technique for systematizing the Dantzig method is explained. The technique has been found useful in simplifying coding and in reducing iter.ation time on a digital computer. The f i r s t use of the technique was in a novel program aimed at problems for which the number of destinati