𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimal cost flow problem with convex costs

✍ Scribed by V. V. Menon

Publisher
John Wiley and Sons
Year
1965
Tongue
English
Weight
432 KB
Volume
12
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A note on minimum cost convex flows
A note on minimum cost convex flows
✍ D. L. Adolphson πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 92 KB
Optimal control of network flows with co
Optimal control of network flows with convex cost and state constraints
✍ A. T. Ernst; C. J. Goh πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 275 KB πŸ‘ 1 views

Consider a network in which a commodity #ows at a variable rate across the arcs in order to meet supply/demand at the nodes. The aim is to optimally control the rate of #ow such that a convex objective functional is minimized. This is an optimal control problem with a large number of states, and wit