Ključne besede: dynamic programming, combinatorial optimization, ant colony optimization, shortest path problem, bottleneck path problem, traveling salesman problem, parallel algorithms, asymptotic analysis, expected-case analysisObjavljeno v RUP: 17.12.2025; Ogledov: 941; Prenosov: 9 Celotno besedilo (927,66 KB)Gradivo ima več datotek! Več...