✦ LIBER ✦

Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms

✍ Scribed by Derek E. Armstrong; Sheldon H. Jacobson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search algorithms for finding the

✍ Paolo Detti; Carlo Meloni; Marco Pranzo 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 409 KB

A modified orthogonal-descent algorithm

✍ M. B. Shchepakin; I. A. Shubenkova 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 482 KB