✦ LIBER ✦

A greedy reduction algorithm for setup optimization

✍ Scribed by Ulrich Faigle; Rainer Schrader

Book ID: 104184378
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 533 KB
Volume: 35
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90297-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal greedy algorithms for indifferen

Optimal greedy algorithms for indifference graphs

✍ Peter J. Looges; Stephan Olariu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 658 KB

A greedy algorithm for the optimal basis

A greedy algorithm for the optimal basis problem

✍ Oleg Burdakov 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 455 KB

Note: On the greedy algorithm for optima

Note: On the greedy algorithm for optimal assembly

✍ Laurence A. Baxter; Farid Harche 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

A greedy algorithm for supervised discre

A greedy algorithm for supervised discretization

✍ Richard Butterworth; Dan A. Simovici; Gustavo S. Santos; Lucila Ohno-Machado 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 399 KB

A greedy algorithm for convex geometries

✍ Kenji Kashiwabara; Yoshio Okamoto 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions deÿned on the sets of the extreme points of a convex geometry. Faigle-Kern (Math. Programming 72 (1996) 195-206) presented a greedy algorithm to linear program

The greedy algorithm is optimal for on-l

The greedy algorithm is optimal for on-line edge coloring

✍ Amotz Bar-Noy; Rajeev Motwani; Joseph Naor 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 270 KB