✦ LIBER ✦

Synthesizing optimization algorithms for scheduling partially ordered set of problems

✍ Scribed by V. V. Menshikh; E. Yu. Nikulina

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some optimal algorithms for decomposed p

✍ Vijay K. Garg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Transversal Graphs for Partially Ordered

✍ Martin Middendorf; Vadim G. Timkovsky 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 98 KB

Optimal semi-online algorithms for preem

✍ Yiwei Jiang; Yong He 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 621 KB

Algorithms for Dualization over Products

✍ Elbassioni, Khaled M. 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 386 KB

An Optimal Algorithm to Find the Jump Nu

✍ L. Bianco; P. Dell‘Olmo; S. Giordani 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 149 KB

An analysis of the greedy algorithm for

✍ Cornelius Croitoru 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 260 KB