𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for a special case of a generalization of the Richardson extrapolation process

✍ Scribed by Avram Sidi

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
393 KB
Volume
38
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch & cut algorithm for the windy g
A branch & cut algorithm for the windy general routing problem and special cases
✍ Angel CorberΓ‘n; Isaac Plana; JosΓ© M. Sanchis πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 201 KB πŸ‘ 1 views

## Abstract In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real‐life applications. The Branch & Cut method presented here is based on a cutting‐plane algorithm that identi

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv