The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

Abstract: Noncommutative constraint satisfaction problems (CSPs) are higher-dimensional operator extensions of classical CSPs. Their approximability remains largely unexplored. A notable example of a ...

Nash equilibria represent a cornerstone in game theory, defining strategy profiles wherein no player can benefit by unilaterally deviating. This concept underpins a myriad of applications, ranging ...

A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

The ATA algorithm provides a novel approximation framework for analytic functions that cannot be expressed in closed-form via elementary or algebraic functions. It introduces a hybrid approximation ...

Note: This is the code implementation from a research paper two years ago. While the code structure might be relatively basic, its main innovation lies in successfully implementing a highly abstract ...

The Traveling Salesman Problem with Backhauls (TSPB) is defined on a graph G = (V, E). The vertex set is partitioned into V=({v1},L,B), where v1 is a depot, L is a set of linehaul customers, and B is ...