Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
From MaRDI portal
Publication:4788367
DOI10.1016/S0167-739X(02)00106-1zbMath1043.68112OpenAlexW2119419950MaRDI QIDQ4788367
No author found.
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
Related Items (5)
A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem ⋮ Traveling salesman problem with clustering ⋮ On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ Backbone analysis and algorithm design for the quadratic assignment problem ⋮ Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem
Uses Software
This page was built for publication: Searching for Backbones—a high-performance parallel algorithm for solving combinatorial optimization problems
