A non improving simplex algorithm for transportation problems

DOI10.1051/ro/1996300100011zbMath0857.90087OpenAlexW2285034640MaRDI QIDQ4888146

Konstantinos Paparrizos

Publication date: 11 March 1997

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105106

zbMATH Keywords

transportation problempivotingstrong basessimplex type algorithmforest algorithmsexterior point algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

Exterior point simplex-type algorithms for linear and network optimization problems

This page was built for publication: A non improving simplex algorithm for transportation problems