scientific article; zbMATH DE number 6135072

zbMath1284.90037MaRDI QIDQ4906130

Tomonari Kitahara, Shinji Mizuno, Tomomi Matsui

Publication date: 7 February 2013

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol8/p447.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingsimplex methodbounded variablesmaximum flow problemminimum cost flow problembasic feasible solutions

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond ⋮ On the number of solutions generated by the dual simplex method ⋮ Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm ⋮ On the Length of Monotone Paths in Polyhedra

This page was built for publication: