✦ LIBER ✦

Asymptotic optimality of some multicriterion optimization algorithms

✍ Scribed by N. M. Popov

Publisher: Springer
Year: 1993
Tongue: English
Weight: 531 KB
Volume: 4
Category: Article
ISSN: 1046-283X
DOI: 10.1007/bf01128755

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some algorithmic problems of multicri

On some algorithmic problems of multicriterion optimization on graphs

✍ V.A. Emelichev; V.A. Perepelitsa 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 983 KB

Numerical algorithms for multicriterion

Numerical algorithms for multicriterion optimization

✍ N. M. Popov 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 631 KB

Cellular genetic algorithm technique for

Cellular genetic algorithm technique for the multicriterion design optimization

✍ Olcay Ersel Canyurt; Prabhat Hajela 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 475 KB

Computational complexity of multicriteri

Computational complexity of multicriterion optimization

✍ N. M. Popov 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 538 KB

Characterization of the optimal set of t

Characterization of the optimal set of the multicriterion optimization problem

✍ A.I. Golikov; G.G. Kotkin 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 819 KB

Asymptotic analysis of an optimized quic

Asymptotic analysis of an optimized quicksort algorithm

✍ Marianne Durand 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Jon Bentley and Douglas McIlroy have implemented a fast quicksort for the C standard library in 1993. We consider here the average-case complexity in terms of number of comparisons of this algorithm, and give its asymptotic expansion up to the constant order.