Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined meas…

A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based rel…

The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally ch…

The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elabo…

This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. The proposed algorithm combines an order-…

Label ranking aims to learn a mapping from instances to rankings over a finite number of predefined labels. Random forest is a powerful and one of th…

Given an undirected graph $G = (V,E)$ with a set $V$ of vertices and a set $E$ of edges, the minimum sum coloring problem (MSCP) is to find a legal v…

The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algori…

We have proposed in this article a framework for the compilation of QCSP: the QCSP bases. We have defined an algorithm embedded in the state-of-the-art search algorithm of QCSP solver to compute a QCSP base from a QCSP. We have shown that the obtain…

We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this form…

Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Group…

Given a set of $n$ elements separated by a pairwise distance matrix, the minimum differential dispersion problem (Min-Diff DP) aims to identify a sub…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account