Discrete Set Handling

DOI10.1007/978-3-540-92151-6_7zbMath1176.90449OpenAlexW68223834MaRDI QIDQ3649627

Ivan Zelinka

Publication date: 4 December 2009

Published in: Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92151-6_7

Mathematics Subject Classification ID

Stochastic programming (90C15)

Cites Work

• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Benchmarks for basic scheduling problems
• CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
• The Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete Set Handling