A parametric algorithm for convex cost network flow and related problems
type: Item
instance of: scholarly article
title: A parametric algorithm for convex cost network flow and related problems
zbMATH Open document ID: 0532.90034
DOI: 10.1016/0377-2217(84)90076-6
author: J. L. Batra
author: S. K. Gupta
author: Ravindra K. Ahuja
published in: European Journal of Operational Research
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 3845310
zbMATH Keywords: computational complexity
zbMATH Keywords: polynomial boundedness
zbMATH Keywords: computational results
zbMATH Keywords: context cost network flow problem
zbMATH Keywords: minimum cost flow
zbMATH Keywords: parametric algorithm
zbMATH Keywords: optimum basis structure
zbMATH Keywords: shortest paths
zbMATH Keywords: large size problems
zbMATH Keywords: project cost curve
zbMATH Keywords: CPM network
zbMATH Keywords: optimum capacity expansion
MaRDI profile type: Publication
full work available at URL: 0377-2217(84)90076-6
OpenAlex ID: W2052415705
cites work: An algorithm for optimizing network flow capacity under economies of scale
cites work: Linear programming under uncertainty
cites work: Q3844775
cites work: The allocation of aircraft to routes -- an example of linear programming under uncertain demand
cites work: A Direct Search Method to Locate Negative Cycles in a Graph
cites work: A network flow computation for project cost curves
cites work: Increasing the capacity of a network: the parametric budget problem
cites work: Calculating Maximal Flows in a Network with Positive Gains
cites work: Q5595961
cites work: Critical-Path Planning and Scheduling: Mathematical Basis
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q4130999
cites work: The minimal cost flow problem with convex costs
cites work: Monotone networks
cites work: Q4039868
cites work: Optimum flows in general communication networks
cites work: Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
cites work: Q5550828
cites work: On Max Flows with Gains and Pure Min-Cost Flows
cites work: A Primal Algorithm to Solve Network Flow Problems with Convex Costs
description: scientific article; zbMATH DE number 3845310