INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

DOI10.15807/JORSJ.32.174MaRDI QIDQ3830788zbMATH OpenOpenAlexFDO

Authors Ryuji Katsura, Masao Fukishima, Toshihide Ibaraki

Publication date 1989

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.32.174

zbMATH Keywords

feasible descent methodsinterior penalty functionnonlinear minimum cost network flow problem

Mathematics Subject Classification ID

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

Recommendations

• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• scientific article; zbMATH DE number 3869028
• A network penalty method
• A combinatorial interior point method for network flow problems
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems

Cited in

(9)

• A network penalty method
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• A Simple Efficient Interior Point Method for Min-Cost Flow
• Multipoint methods for separable nonlinear networks
• scientific article; zbMATH DE number 3869028 (Why is no real title available?)
• Implementing an “exact” Newton method for separable convex transportation problems
• DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
• An annotated bibliography of network interior point methods
• Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

This page was built for publication: INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS

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