✦ LIBER ✦

Note: On the greedy algorithm for optimal assembly

✍ Scribed by Laurence A. Baxter; Farid Harche

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 245 KB
Volume: 39
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199210)39:6<833::aid-nav3220390608>3.0.co;2-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On metaheuristic algorithms for combinat

On metaheuristic algorithms for combinatorial optimization problems

✍ Mutsunori Yagiura; Toshihide Ibaraki 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

A note on the optimality conditions for

A note on the optimality conditions for the bilevel programming problem

✍ P. A. Clark; A. W. Westerberg 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

Application of new systems techniques an

Application of new systems techniques and the greedy algorithm for reliability data reconstruction

✍ Hamid R. Jafari; Fouad N. Jalbout; Thomas F. Hassett 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

The main objective of this paper is to apply new systems techniques for condensing information that is contained in a reliability data set. These techniques, augmented with the Greedy Algorithm, were used to develop an algorithm for reduced data set reconstruction. The techniques go beyond tradition

A note on genetic algorithms for degree-

A note on genetic algorithms for degree-constrained spanning tree problems

✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to

Short Communication: A note on optimal h

Short Communication: A note on optimal hybrid V-cycle multilevel algorithms for mixed finite element systems with penalty term

✍ Chen-Yao G. Lai 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

In this paper, we investigate some cost-effective hybrid V -cycle multilevel algorithms for the discrete systems that arise when a mixed finite element approach is used to solve certain second-order elliptic boundary value problems. By introducing a small penalty parameter, the perturbed indefinite

Radical performance enhancements for com

Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem

✍ Gordon, D. Benjamin; Mayo, Stephen L. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

Recent advances in protein design have demonstrated the effectiveness of optimization algorithms based on the dead-end elimination theorem. The algorithms solve the combinatorial problem of finding the optimal placement of side chains for a set of backbone coordinates. Although they are powerful too