Applying steepest-edge techniques to a network primal-dual algorithm

DOI10.1016/S0305-0548(96)00086-XzbMath0882.90036MaRDI QIDQ1362969

Norman D. Curet

Publication date: 7 August 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

primal-dual algorithmminimum cost network flowsteepest-edge criteria

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

An exterior simplex type algorithm for the minimum cost network flow problem

Uses Software

• NETGEN
• RELAX4

Cites Work

• A primal-dual simplex method for linear programs
• An incremental primal-dual method for generalized networks
• Steepest-edge simplex algorithms for linear programming
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Applying steepest-edge techniques to a network primal-dual algorithm