Applying steepest-edge techniques to a network primal-dual algorithm
type: Item
instance of: scholarly article
title: Applying steepest-edge techniques to a network primal-dual algorithm
zbMATH Open document ID: 0882.90036
DOI: 10.1016/S0305-0548(96)00086-X
author: Norman D. Curet
published in: Computers \& Operations Research
publication date: 1997-08-07T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1045746
zbMATH Keywords: steepest-edge criteria
zbMATH Keywords: primal-dual algorithm
zbMATH Keywords: minimum cost network flow
describes a project that uses: RELAX4
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Steepest-edge simplex algorithms for linear programming
cites work: A primal-dual simplex method for linear programs
cites work: Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
cites work: A polynomially bounded algorithm for a singly constrained quadratic program
cites work: Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
cites work: An incremental primal-dual method for generalized networks
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q3056948
cites work: Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
cites work: Q4283439
cites work: Q4283440
cites work: Q4283447
description: scientific article; zbMATH DE number 1045746