Sparse dual transportation polyhedra: Extreme points and signatures

DOI10.1016/0167-6377(90)90050-FzbMATH Open0696.90039OpenAlexW1990147836MaRDI QIDQ911458FDOQ911458

Authors: J. 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

Recommendations

• Faces of dual transportation polyhedra
• Adjacent Extreme Points Of A Transportation Polytope
• The Hirsch Conjecture for Dual Transportation Polyhedra
• Extreme points of certain transportation polytopes with fixed total sums
• On the circuit diameter of dual transportation polyhedra

zbMATH Keywords

best upper bounddual transportation polyhedranumber of extreme points

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Faces of dual transportation polyhedra

Cited In (3)

• Faces of dual transportation polyhedra
• Title not available (Why is that?)
• Signature classes of transportation polytopes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911458)