✦ LIBER ✦

Metaheuristic algorithms for combinatorial optimization problems

✍ Scribed by Manuel Iori

Publisher: Springer
Year: 2005
Tongue: English
Weight: 41 KB
Volume: 3
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-005-0052-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On metaheuristic algorithms for combinat

On metaheuristic algorithms for combinatorial optimization problems

✍ Mutsunori Yagiura; Toshihide Ibaraki 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 2 views

Metaheuristics in Combinatorial Optimiza

Metaheuristics in Combinatorial Optimization

✍ Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 489 KB

Applying combinatorial optimization meta

Applying combinatorial optimization metaheuristics to the golf scramble problem

✍ Roger G. Dear; Zvi Drezner 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

A survey on metaheuristics for stochasti

A survey on metaheuristics for stochastic combinatorial optimization

✍ Leonora Bianchi; Marco Dorigo; Luca Maria Gambardella; Walter J. Gutjahr 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 615 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

Models and algorithms for combinatorial

Models and algorithms for combinatorial optimization problems arising in railway applications

✍ Valentina Cacchiani 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 81 KB