𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for the transshipment along a single road problem

✍ Scribed by Agha Iqbal Ali

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
485 KB
Volume
33
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Algorithm for the Complex R
An Efficient Algorithm for the Complex Roots Problem
✍ C.Andrew Neff; John H. Reif πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ΟͺȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

An Efficient Algorithm for the k-Pairwis
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
✍ Qian-Ping Gu; Shietung Peng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype

An efficient heuristic for the multi-ite
An efficient heuristic for the multi-item newsboy problem with a single constraint
✍ Steven Nahmias; Charles P. Schmidt πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more effici

An algorithm for defining a single near-
An algorithm for defining a single near-optimum mesh for multiple-load-case problems
✍ Mark S. Shephard πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 391 KB

## Abstract A method for defining a single near‐optimum finite element discretization for multiple‐load‐case problems is described. An example problem is included to demonstrate the application of the multiple‐load‐case algorithm. A comparison to a fine uniform mesh is also included to indicate the