✦ LIBER ✦

Tighter bounds on a heuristic for a partition problem

✍ Scribed by Joseph Y.-T. Leung; W.-D. Wei

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic partitioning algorithm for a

✍ M. B. Korchemkin 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 295 KB

A heuristic algorithm for the equitable

✍ F.A. O'Brien; J. Mingers 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 754 KB

A tighter bound for FFd algorithm

✍ LI Rongheng; Yue Minyi 📂 Article 📅 2000 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 603 KB

A heuristic algorithm for a network prob

✍ Bala Shetty 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB

A set partitioning heuristic for the gen

✍ Dirk.G. Cattrysse; Marc Salomon; Luk N. Van Wassenhove 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 530 KB

A heuristic and lower bound for a multi-

✍ Robert T. Sumichras; Ina S. Markham 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 653 KB