PRACTICAL ASPECTS OF SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS.

[PDF] jomardpublishing.com

[PDF][PDF] A new heuristic for solving travelling salesman problem: adding the furthest vertex to the central triangle

F Nuriyeva, S Polat - J. Modern Technol. Eng, 2023 - jomardpublishing.com
1 Introduction Page 1 Journal of Modern Technology and Engineering Vol.8, No.1, 2023, pp.19-26
A NEW HEURISTIC FOR SOLVING TRAVELLING SALESMAN PROBLEM: ADDING THE …
被引用次数：1 相关文章 所有 2 个版本

A Simple Iterative Algorithm for Boolean Knapsack Problem

F Nuriyeva, U Nuriyev, O Ugurlu - The International Conference on …, 2019 - Springer
Abstract The Boolean Knapsack Problem, which has numerous real life applications, is a
combinatorial optimization problem. Since the problem belongs to NP-Hard, many …
被引用次数：1 相关文章 所有 2 个版本
[PDF] jomardpublishing.com

[PDF][PDF] A METHOD BASED ON HIERARCHICAL CLUSTERING FOR TRAVELLING SALESMAN PROBLEM.

F Nuriyeva - Journal of Modern Technology and Engineering, 2019 - jomardpublishing.com
1 Introduction Page 1 Journal of Modern Technology and Engineering Vol.4, No.2, 2019, pp.53-61
A METHOD BASED ON HIERARCHICAL CLUSTERING FOR TRAVELLING SALESMAN …
相关文章 所有 2 个版本