A network penalty method

DOI10.1007/BF01594924zbMath0813.90042OpenAlexW2004434796MaRDI QIDQ1174423

A. B. Gamble, Andrew R. Conn, William R. Pulleyblank

Publication date: 25 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01594924

zbMATH Keywords

minimum cost network flownonlinear penalty function

Mathematics Subject Classification ID

Related Items (6)

Discontinuous piecewise linear optimization ⋮ Automatic decrease of the penalty parameter in exact penalty function methods ⋮ A smooth penalty function algorithm for network-structured problems ⋮ The continuous quadrant penalty formulation of logical constraints ⋮ Quadratic cost flow and the conjugate gradient method ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• A penalty linear programming method using reduced-gradient basis-exchange techniques
• On cycling in the network simplex method
• An efficient implementation of the network simplex method
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Linear Programming via a Nondifferentiable Penalty Function
• A network simplex method
• Theoretical Properties of the Network Simplex Method
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Constrained Optimization Using a Nondifferentiable Penalty Function

This page was built for publication: A network penalty method