✦ LIBER ✦

A greedy random adaptive search procedure for the weighted maximal planar graph problem

✍ Scribed by Ibrahim H. Osman; Baydaa Al-Ayoubi; Musbah Barake

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Greedy Randomized Adaptive Search Proc

✍ Panos M. Pardalos; Tianbing Qian; Mauricio G.C. Resende 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 78 KB

A Greedy Randomized Adaptive Search Proc

✍ Binato, S.; Oliveira, G. C.; Araujo, J. L. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 567 KB

Greedy random adaptive memory programmin

✍ Samad Ahmadi; Ibrahim H. Osman 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A Set of Greedy Randomized Adaptive Loca

✍ Alexander J. Robertson 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 221 KB

The continuous Berth Allocation Problem:

✍ Der-Horng Lee; Jiang Hang Chen; Jin Xin Cao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 734 KB

An algorithm for embedding a biconnected

✍ Ken Kotani; Sumio Masuda; Toshinobu Kashiwabara 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 962 KB