Optimization and its related solving methods are becoming increasingly important in most
academic and industrial fields. The goal of the optimization process is to make a system or a …

Grou** problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …

We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes
qudits in a product state, with each qudit representing a node in the graph and …

With the imminent growth in air travel, ensuring the efficiency of airspace has become a
necessity. This work addresses this specific concern, namely, the optimization of a Free …

In this paper, we propose a high-speed greedy sequential algorithm for the vertex coloring
problem (VCP), based on the Wave Function Collapse algorithm, called Wave Function …

Many problems of practical and theoretical importance within the fields of Artificial
Intelligence and Operations Research are combinatorial. Combinatorial optimization …

We revisit a Renyi entropy based measure introduced originally for image clustering [1], and
study its application to graph clustering. To effectuate Renyi entropy based graph clustering …

In this paper, we propose heuristics for the (k,i)- coloring problem, which is a generalization
of classical graph coloring problem. We also explore an application of (k,i)-coloring problem …

Flow based networks have been studied over the years, which have considered different
interpretations of a flow, for instance where a flow may be based on transfer (eg, package …