An incremental primal-dual method for generalized networks

DOI10.1016/0305-0548(94)90035-3zbMath0813.90121OpenAlexW2037399180MaRDI QIDQ1342940

Norman D. Curet

Publication date: 15 January 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90035-3

zbMATH Keywords

large-scale generalized networkout-of-kilter methodsprimal-dual simplexrandomly generated benchmark problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (2)

Applying steepest-edge techniques to a network primal-dual algorithm ⋮ A primal-dual simplex method for linear programs

Uses Software

• RELAX4

Cites Work

• Unnamed Item
• A primal-dual simplex method for linear programs
• New labeling procedures for the basis graph in generalized networks
• Solving Generalized Networks
• Solving Large Scale Generalized Networks
• Relaxation Methods for Linear Programs
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms

This page was built for publication: An incremental primal-dual method for generalized networks