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

The application of a minimization method for solving reacting-distillation problems

โœ Scribed by K. Alejski; J. Szymanowski; M. Bogacki

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
592 KB
Volume
12
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A shortest augmenting path method for so
A shortest augmenting path method for solving minimal perfect matching problems
โœ Ulrich Derigs ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a

Variations on a cutting plane method for
Variations on a cutting plane method for solving concave minimization problems with linear constraints
โœ A. Victor Cabot ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th

A method for solving the Kondo problem
A method for solving the Kondo problem
โœ V.M. Filyov; P.B. Wiegmann ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 267 KB