𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the longest cycle problem

✍ Scribed by E. T. Dixon; S. E. Goodman

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
504 KB
Volume
6
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

AN ALGORITHM FOR THE SEGREGATED STORAGE
AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM
✍ A. W. Neebe; M. R. Rao πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

## Abstract The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one

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 algorithm for the discrete bilevel pr
An algorithm for the discrete bilevel programming problem
✍ Jonathan F. Bard; James T. Moore πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting