Problem trgovskega potnika (asimetrični)

Slike simbolizirajo raziskovalno delo laboratorija in so ustvarjene s pomočjo AI

Instance size (number of nodes) 4 (min cost = 15) 5 (min cost = 20) 6 (min cost = 25)	Initial cost configuration Static configuration Random configuration
	Cost: {{ cost }} ✓ Solution found! Click counter: {{ counter }} Note: The objective is to find a valid Hamiltonian cycle — a path that visits each node exactly once and returns to the starting point — with the lowest total cost. Both edges and their associated costs (numbers) are clickable to select the same connection.

Raziskovalna dejavnost

Brest, Janez; Brest, Aljaž; Pšeničnik, Blaž; Popič, Jan; Berkovič, Klemen; Bošković, Borko

In: pp. 357–360, Slovenska sekcija IEEE; Fakulteta za elektrotehniko, 2025.

Brest, Janez; Žerovnik, Janez

A heuristic for the asymmetric traveling salesman problem Proceedings Article

In: 6th Metaheuristics International Conference, pp. 145–150, Citeseer 2005.

Brest, Janez; Žerovnik, Janez

In: Ricerca operativa, vol. 28, pp. 59–67, 1999.