Sparse dual transportation polyhedra: Extreme points and signatures

DOI10.1016/0167-6377(90)90050-FzbMath0696.90039OpenAlexW1990147836MaRDI QIDQ911458

Jaime E. González

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90050-f

zbMATH Keywords

best upper bounddual transportation polyhedranumber of extreme points

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Polytopes and polyhedra (52Bxx)

Related Items (1)

Signature classes of transportation polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Faces of dual transportation polyhedra
• The Hirsch Conjecture for Dual Transportation Polyhedra
• Efficient dual simplex algorithms for the assignment problem
• Signature Methods for the Assignment Problem
• A competitive (dual) simplex method for the assignment problem
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems

This page was built for publication: Sparse dual transportation polyhedra: Extreme points and signatures