scientific article; zbMATH DE number 1163099

MaRDI QIDQ4394588zbMATH OpenFDO

Authors Kristina Holmqvist, Athanasios Migdalas, Panos M. Pardalos

Publication date 11 June 1998

zbMATH Keywords

genetic algorithmsGRASPsimulated annealingtabu search

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Combinatorial optimization (90C27)

Recommendations

• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• scientific article; zbMATH DE number 4037239
• scientific article; zbMATH DE number 1302200
• scientific article; zbMATH DE number 686901
• Parallel Search Algorithms for Discrete Optimization Problems
• Parallel processing for difficult combinatorial optimization problems
• scientific article; zbMATH DE number 4131653
• Solving combinatorial optimization problems in parallel: methods and techniques
• The complexity of parallel search

Cited in

(19)

• Parallel processing for difficult combinatorial optimization problems
• An analysis of parallel heuristics for task allocation in multicomputers
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• The parallel search bench ZRAM and its applications
• Morph-based local-search heuristics for large-scale combinatorial data analysis
• On parallelizing a greedy heuristic for finding small dominant sets
• A first multilevel cooperative algorithm for capacitated multicommodity network design
• Expanding neighborhood GRASP for the traveling salesman problem
• Strategies for the parallel implementation of metaheuristics
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• Plenary Lecture 1: The blocking meta-heuristics for combinatorial problems solving
• Parallel Hybrid Metaheuristics
• Parallel solution methods for vehicle routing problems
• Batched dynamic solutions to decomposable searching problems
• The parallel complexity of TSP heuristics
• Heuristics from Nature for Hard Combinatorial Optimization Problems
• Parallelization strategies for rollout algorithms
• Metaheuristic downhill simplex method in combinatorial optimization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394588)