𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate solutions of capacitated fixed-charge minimum cost network flow problems

✍ Scribed by Do Ba Khang; Okitsugu Fujiwara

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
801 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heuristic solutions for general concave
Heuristic solutions for general concave minimum cost network flow problems
✍ Dalila B.M.M. Fontes; JosΓ© Fernando GonΓ§alves πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N

Commodity family extended formulations o
Commodity family extended formulations of uncapacitated fixed charge network flow problems
✍ Ng, Peh H.; Rardin, Ronald L. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 308 KB

Uncapacitated fixed charge network flow problems are single-commodity flow problems with (positive) fixed charges for opening some arcs and no capacities. Previous research has shown that much improved linear programming relaxations can be obtained by reformulating these problems in terms of an exte