✦ LIBER ✦

Speeding up branch and bound algorithms for solving the maximum clique problem

✍ Scribed by Evgeny Maslov, Mikhail Batsyn, Panos M. Pardalos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the max

✍ L. Babel; G. Tinhofer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 451 KB

Branch and bound algorithms for the maxi

✍ Carmo, Renato; Züge, Alexandre 📂 Article 📅 2011 🏛 SciELO 🌐 English ⚖ 538 KB

An efficient branch-and-bound algorithm

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 95 KB

An Efficient Branch-and-bound Algorithm

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 227 KB

A branch-and-bound algorithm for solving

✍ Patrick G. McKeown 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

Application of parallel heuristic algori

✍ M. A. Posypkin; I. Kh. Sigal 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 362 KB