✦ LIBER ✦

Potential reduction algorithms for structured combinatorial optimization problems

✍ Scribed by J.P. Warners; T. Terlaky; C. Roos; B. Jansen

Book ID: 108410525
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 675 KB
Volume: 21
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(97)00031-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Metaheuristic algorithms for combinatori

Metaheuristic algorithms for combinatorial optimization problems

✍ Manuel Iori 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 41 KB

Approximation algorithms for combinatori

Approximation algorithms for combinatorial multicriteria optimization problems

✍ M. Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Approximation algorithms for combinatori

Approximation algorithms for combinatorial multicriteria optimization problems

✍ Matthias Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

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

Rollout Algorithms for Combinatorial Opt

Rollout Algorithms for Combinatorial Optimization

✍ Dimitri P. Bertsekas; John N. Tsitsiklis; Cynara Wu 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 142 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