𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimal average cost flow problem

✍ Scribed by Y.L. Chen

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
600 KB
Volume
81
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Infinite networks: Minimal cost flows
Infinite networks: Minimal cost flows
✍ B. Fuchssteiner; K. Morisse πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 323 KB

We are concerned with the minimal cost flow problem in infinite networks. The generalisation to infinite networks is made in order to provide tools for the study of the dynamics of such networks. By disintegration methods, we obtain that the minimal transportation costs are the supremum of the diffe

Average-case analysis of the bin-packing
Average-case analysis of the bin-packing problem with general cost structures
✍ Julien Bramel; WanSoo T. Rhee; David Simchi-Levi πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 100 KB

We consider a version of the famous bin-packing problem where the cost of a bin is a concave function of the number of items in the bin. We analyze the problem from an average-case point of view and develop techniques to determine the asymptotic optimal solution value for a variety of functions. We

Solving the undirected minimum cost flow
Solving the undirected minimum cost flow problem with arbitrary costs
✍ A. SedeΓ±o-Noda; C. GonzΓ‘lez-MartΓ­n; S. Alonso πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 66 KB

## Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This sit