The minimal average cost flow problem
type: Item
instance of: scholarly article
title: The minimal average cost flow problem
zbMATH Open document ID: 0912.90126
DOI: 10.1016/0377-2217(93)E0348-2
author: S. H. Smith
published in: European Journal of Operational Research
publication date: 1998-08-16T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1191372
zbMATH Keywords: flow costs
zbMATH Keywords: arc capacities
zbMATH Keywords: min-cost flow problem
MaRDI profile type: Publication
cites work: Multicommodity network flows—A survey
cites work: Canceling most helpful total cuts for minimum cost network flow
cites work: A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
cites work: An O (n 2 (m + N log n )log n ) min-cost flow algorithm
cites work: Multi-Terminal Network Flows
cites work: A minimum concave-cost dynamic network flow problem with an application to lot-sizing
cites work: A Survey of Linear Cost Multicommodity Network Flows
cites work: Q3048571
cites work: Optimization of the flow through networks with gains
cites work: Q3802859
cites work: A strongly polynomial minimum cost circulation algorithm
full work available at URL: 0377-2217(93)e0348-2
OpenAlex ID: W2094286968
description: scientific article; zbMATH DE number 1191372