Copyright © 2000 Academic Press. All rights reserved.
Regular Article
On the Number of Faces of Certain Transportation Polytopes
Received 20 January 1999;
revised 14 December 1999.
Available online 10 April 2002.
Abstract
Define the transportation polytope Tn, mto be a polytope of non-negative n × m matrices with row sums equal to m and column sums equal ton . We present a new recurrence relation for the numbers fkof the k -dimensional faces for the transportation polytope Tn, n + 1. This gives an efficient algorithm for computing the numbers fk, which solves the problem known to be computationally hard in a general case.
1 Email: paki@math.yale.edu






E-mail Article
Add to my Quick Links

Cited By in Scopus (3)





