scientific article; zbMATH DE number 3869028

MaRDI QIDQ3337181zbMATH OpenFDO

Authors Katharina Belling-Seib

Publication date 1984

zbMATH Keywords

conjugate gradient methodnetwork flow problemsnumerical efficiencycost minimizationimplementation techniqueschoice of data structuresconvex separable costs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• Quadratic cost flow and the conjugate gradient method
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• An efficient implementation of the network simplex method

Cited in

(11)

• scientific article; zbMATH DE number 4128670 (Why is no real title available?)
• An affine scaling method for solving network flow problems
• Mathematical Programming and Electrical Network Analysis II: Computational Linear Algebra through Network analysis
• A hybrid algorithm for solving convex separable network flow problems
• Quadratic cost flow and the conjugate gradient method
• Computational development of a lagrangian dual approach for quadratic networks
• Performance of some approximate subgradient methods over nonlinearly constrained networks
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• A method of network programming in problems of nonlinear optimization
• Exact solution of network flow models with strong relaxations
• INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337181)