Malcolm Low | Practical AI, Computing & Quantum Research

Singapore-based practical guides, tutorials and experiments in AI, computing, modelling, simulation, optimisation and quantum computing, with research notes and hands-on workflows.

Tag: traveling salesman problem

Browse by date

September 2026
M	T	W	T	F	S	S
	1	2	3	4	5	6
7	8	9	10	11	12	13
14	15	16	17	18	19	20
21	22	23	24	25	26	27
28	29	30

25 Aug 2026

Solving the Traveling Salesman Problem: Nearest Neighbor, 2-Opt, 3-Opt and Tabu Search

Learn how nearest neighbor builds a Traveling Salesman tour, how 2-opt and 3-opt improve it, and how tabu search escapes…
Read article →
4 Aug 2026

Optimization Problems Explained: Traveling Salesman, Job Shop Scheduling, and the Knight’s Tour

What the Traveling Salesman Problem, Job Shop Scheduling, and the Knight’s Tour have in common — combinatorial explosion, NP-hardness, and…
Read article →

Tag: traveling salesman problem

Solving the Traveling Salesman Problem: Nearest Neighbor, 2-Opt, 3-Opt and Tabu Search

Optimization Problems Explained: Traveling Salesman, Job Shop Scheduling, and the Knight’s Tour