✦ LIBER ✦

An approximation algorithm for solving a problem of search for a vector subset

✍ Scribed by A. V. Kel’manov; S. M. Romanchenko

Book ID: 114994296
Publisher: Pleiades Publishing
Year: 2012
Tongue: English
Weight: 452 KB
Volume: 6
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478912010097

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation scheme for a problem of

An approximation scheme for a problem of search for a vector subset

✍ Shenmaier, V. V. 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 470 KB

An approximation algorithm for solving a

An approximation algorithm for solving a problem of cluster analysis

✍ A. V. Dolgushev; A. V. Kel’manov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 445 KB

A Fast Approximation Algorithm for the S

A Fast Approximation Algorithm for the Subset-sum Problem

✍ Bartosz Przydatek 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

A search algorithm for solving the gener

A search algorithm for solving the general problem of mathematical programming

✍ E.I. Volynskii; M.Z. Khenkin 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 682 KB

A genetic algorithm for subset sum probl

A genetic algorithm for subset sum problem

✍ Rong Long Wang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A parallel tabu search algorithm for sol

A parallel tabu search algorithm for solving the container loading problem

✍ A Bortfeldt; H Gehring; D Mack 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Iss