𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the convergence of an integer-programming process

✍ Scribed by R. E. Gomory; A. J. Hoffman; Thomas J. Watson

Publisher
John Wiley and Sons
Year
1963
Tongue
English
Weight
159 KB
Volume
10
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Directed Perturbation Analysis of an Int
Directed Perturbation Analysis of an Integer Program
✍ Hsiao-Fan Wang; Jyh-Shing Horng πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 140 KB

In this paper, we examine the largest tolerance levels in integer programming Ε½ . IP problems when the perturbation occurs on the right hand sides of the constraints in positive or negative directions. Based on the properties of defined stepsizes, we have not only revealed the nested and the inverte

A Note on the Convergence of Integral Fu
A Note on the Convergence of Integral Functionals of Diffusion Processes. An Application to Strong Convergence
✍ F. Liese; W. Schmidt πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

For a diffusion type process dX, = d w + a(t, X) dt and a sequence (f,) of nonnegative functions necessary and sufficient conditions to the f, are established which guarantee the as. convergence of fn(X,) dt to zero. This result is applied to derive simple necessary and sufficient conditions for the

An analysis of six greedy selection rule
An analysis of six greedy selection rules on a class of zero-one integer programming models
✍ G. Edward Fox; Christopher J. Nachtsheim πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 509 KB

Six greedy primal selection rules are evaluated on a class of generalized set packing models. The evaluation is conducted in accordance with experimental design methodologies proposed by Lin and Rardin. Results indicate that the simplest of rules performs best, except when the model constraints exhi