scientific article; zbMATH DE number 3869028
From MaRDI portal
Publication:3337181
zbMATH Open0545.90036MaRDI QIDQ3337181FDOQ3337181
Authors: Katharina Belling-Seib 
Publication date: 1984
Title of this publication is not available (Why is that?)
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
conjugate gradient methodnetwork flow problemsnumerical efficiencycost minimizationimplementation techniqueschoice of data structuresconvex separable costs
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (11)
- 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
- An affine scaling method for solving network flow problems
- Title not available (Why is that?)
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)
