The minimum sum coloring problem (MSCP) is an important extension of the graph coloring
problem with wide real-world applications. Compared to the classic graph coloring problem …

Abstract The Graph Coloring Problem is an NP-hard combinatorial optimization problem,
and it is being used in different real-world environments. The chromatic integer is …

The graph coloring problem functions as a fundamental and pivotal combinatorial
optimization task and has played an essential role in various domains such as wireless …

We study a resource allocation problem featuring specific constraints, called exclusivity
constraints, in addition to regular compatibility constraints. Resources are to be allocated to …

As the feature size of semiconductor technology shrinks to 7 nm and beyond, the multiple
patterning lithography (MPL) attracts more attention from the industry. In this paper, we …

By formulating the floorplanning of VLSI as a mixed-variable optimization problem, this
paper proposes to solve it by a memetic algorithm, where the discrete orientation variables …