𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast algorithms for long transportation problems

✍ Scribed by A. Brandt; J. Intrator

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
1002 KB
Volume
5
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Auxiliary procedures for solving long tr
Auxiliary procedures for solving long transportation problems
✍ J. Intrator; M. Berrebi πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

## Abstract An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented.

Fast segmentation algorithms for long hy
Fast segmentation algorithms for long hydrometeorological time series
✍ Hafzullah Aksoy; Abdullah Gedikli; N. Erdem Unal; Athanasios Kehagias πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 256 KB

## Abstract A time series with natural or artificially created inhomogeneities can be segmented into parts with different statistical characteristics. In this study, three algorithms are presented for time series segmentation; the first is based on dynamic programming and the second and the thirdβ€”t

A fast algorithm for constructing monge
A fast algorithm for constructing monge sequences in transportation problems with forbidden arcs
✍ Ron Shamir πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 688 KB

## Shamir, R., A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs, Discrete Mathematics 114 (1993) 435-444. Given a cost matrix of the transportation problem and a permutation of the decision variables, we say that the problem is completely solvable b