The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...