✦ LIBER ✦

Maximum number of iterations in the transportation problem

✍ Scribed by Michel A. Simonnard; G. F. Hadley

Publisher: John Wiley and Sons
Year: 1959
Tongue: English
Weight: 201 KB
Volume: 6
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800060204

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On properties of the iterative maximum l

On properties of the iterative maximum likelihood reconstruction method

✍ H. N. Mülthei; B. Schorr; W. Törnig 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

On the maximum number of cycles in a pla

On the maximum number of cycles in a planar graph

✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib

The maximum number of arc-disjoint arbor

The maximum number of arc-disjoint arborescences in a tournament

✍ Ma Chung-fan; Cai Mao-cheng 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 2 views

## Abstract In this article, we give the maximum number of arc‐disjoint arborescences in a tournament or an oriented complete __r__‐partite graph by means of the indegrees of its vertices.

On the Maximum Number of Cyclic Triples

On the Maximum Number of Cyclic Triples in Oriented Graphs

✍ Lowell W. Beineke; Frank Harary 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Fluid Simulation of Beryllium Transport

Fluid Simulation of Beryllium Transport in the ITER Gaseous Divertor

✍ D. A. Knoll; R. B. Campbell; P. R. McHugh 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB 👁 1 views

## Abstract The transport of either intrinsic or injected impurities will play a crucial role in the energy loss mechanisms in the ITER gaseous/cold plasma target divertor. Both 1‐D and 2‐D multi‐charge state fluid codes are used to model the transport of beryllium in the ITER SOL. Our major conclu