scientific article; zbMATH DE number 1304530

zbMATH Open0923.90137MaRDI QIDQ4251300

Hai-Xiang Lin, Kees Lemmens

Publication date: 28 October 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

traveling salesmanpartitioning based parallel heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Parallel numerical computation (65Y05)

Related Items (2)

A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM ⋮ New parallel randomized algorithms for the traveling salesman problem

Recommendations

• Optimization parallelizing for discrete programming problems 👍 👎
• Divide and conquer strategies for parallel TSP heuristics 👍 👎
• Parallel Tabu Search 👍 👎
• The parallel complexity of TSP heuristics 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q4251300)