A polynomial algorithm for minimum quadratic cost flow problems
type: Item
instance of: scholarly article
title: A polynomial algorithm for minimum quadratic cost flow problems
zbMATH Open document ID: 0555.90039
DOI: 10.1016/0377-2217(84)90160-7
author: Michel Minoux
published in: European Journal of Operational Research
publication date: 1984-01-01T00:00:00Z
review text: Network flow problems with quaratic separable costs appear in a number of important applications such as approximating input-output matrices in economy, projecting and forecasting traffic matrices in telecommunication networks, or solving nondifferentiable cost flow problems by subgradient algorithms. Extending a scaling technique, used in the case of linear cost flows, to quadratic cost flows, a polynomial algorithm for this class of problems is given.
reviewed by: V.Peteanu
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3885618
zbMATH Keywords: quaratic separable costs
zbMATH Keywords: scaling technique
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: 0377-2217(84)90160-7
OpenAlex ID: W1977895455
cites work: Estimating Nonnegative Matrices from Marginal Data
cites work: Minimum norm problems over transportation polytopes
cites work: Feature Article—The Ellipsoid Method: A Survey
cites work: A reduced subgradient algorithm
cites work: Optimal Routing in a Packet-Switched Computer Network
cites work: On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
cites work: Q3863664
cites work: Dealing with degeneracy in reduced gradient algorithms
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q5514188
cites work: Q3960718
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: A polynomially bounded algorithm for a singly constrained quadratic program
cites work: Q3968758
cites work: An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
cites work: Q4197641
cites work: Q3873927
cites work: Q3048571
cites work: A method of solution for quadratic programs
cites work: Q3337942
cites work: The Lattice Point Covering Theorem for Rectangles
cites work: Q5638112
cites work: An operator theory of parametric programming for the transportation problem-I
cites work: Cost operator algorithms for the transportation problem
cites work: The Simplex Method for Quadratic Programming
description: scientific article; zbMATH DE number 3885618