๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Adjacent vertices on transportation polytopes

โœ Scribed by Patrick G. McKeown; David S. Rubin

Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
526 KB
Volume
22
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Determining adjacent vertices on assignm
Determining adjacent vertices on assignment polytopes
โœ Patrick G. McKeown ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 353 KB

## Abstract To rank the solutions to the assignment problem using an extreme point method, it is necessary to be able to find all extreme points which are adjacent to a given extreme solution. Recent work has shown a procedure for determining adjacent vertices on transportation polytopes using a mo

On the Number of Faces of Certain Transp
On the Number of Faces of Certain Transportation Polytopes
โœ Igor Pak ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 93 KB

Define the transportation polytope T n,m to be a polytope of non-negative n ร— m matrices with row sums equal to m and column sums equal to n. We present a new recurrence relation for the numbers f k of the k-dimensional faces for the transportation polytope T n,n+1 . This gives an efficient algorith