✦ LIBER ✦

Evolutionary Algorithms and Matroid Optimization Problems

✍ Scribed by Joachim Reichel; Martin Skutella

Publisher: Springer
Year: 2008
Tongue: English
Weight: 470 KB
Volume: 57
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-008-9253-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiobjective evolutionary algorithms f

Multiobjective evolutionary algorithms for complex portfolio optimization problems

✍ Konstantinos P. Anagnostopoulos; Georgios Mamanis 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 579 KB

Competitive co-evolutionary algorithms c

Competitive co-evolutionary algorithms can solve function optimization problems

✍ Tatsuya Sato; Takaya Arita 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 355 KB

Algorithms for Measuring Perturbability

Algorithms for Measuring Perturbability in Matroid Optimization

✍ Greg N. Frederickson; Roberto Solis-Oba 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 253 KB

Setup optimization problems with matroid

Setup optimization problems with matroid structure

✍ Ulrich Faigle; Rainer Schrader 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 700 KB

Decomposable multi-parameter matroid opt

Decomposable multi-parameter matroid optimization problems

✍ David Fernández-Baca 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 191 KB

New evolutionary genetic algorithms for

New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

✍ Fam Quang Bac; V. L. Perov 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 424 KB

Evolutionary genetic algorithms have been proposed to solve NP-complete combinatorial optimization problems. A new crossover operator based on group theory has been created. Computational processes motivated by proposed evolutionary genetic algorithms were described as stochastic processes, using po