ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (93 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/eujc.1999.0392    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2000 Academic Press. All rights reserved.

Regular Article

On the Number of Faces of Certain Transportation Polytopes

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Igor Pak1

Department of Mathematics, Yale University, New Haven, CT 06520, U.S.A.


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


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.