✦ LIBER ✦

A simple greedy algorithm for a class of shuttle transportation problems

✍ Scribed by Yujun Zheng; Chuanqing Xu; Jinyun Xue

Book ID: 107402555
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 118 KB
Volume: 3
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-009-0126-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of generalized greedy algorithms

A class of generalized greedy algorithms for the multi-knapsack problem

✍ A.H.G. Rinnooy Kan; L. Stougie; C. Vercellis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A simple greedy algorithm for reconstruc

A simple greedy algorithm for reconstructing pedigrees

✍ Cowell, Robert G. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 945 KB

A greedy algorithm for some classes of i

A greedy algorithm for some classes of integer programs

✍ V.V. Shenmaier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

We establish a necessary and su cient condition for a greedy algorithm to ÿnd an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalizat

A simple 0.5-bounded greedy algorithm fo

A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem

✍ U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. De Sarkar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 442 KB

A simple and effective iterated greedy a

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

✍ Rubén Ruiz; Thomas Stützle 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 485 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