Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems

DOI10.1016/S0167-739X(02)00106-1MaRDI QIDQ4788367zbMATH OpenOpenAlexFDO

Authors

Publication date 21 January 2003

Published in Future Generation Computer Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-739x(02)00106-1

zbMATH Keywords

vehicle routing problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
• A parallel algorithm for the vehicle routing problem
• Parallel processing for difficult combinatorial optimization problems
• Publication:4870332
• A parallel simulated annealing algorithm

Cited in

(6)

• Backbone analysis and algorithm design for the quadratic assignment problem
• A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
• Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem
• Traveling salesman problem with clustering
• scientific article; zbMATH DE number 2090690 (Why is no real title available?)
• On the neighborhood structure of the traveling salesman problem generated by local search moves

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems

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