Datasets related to the paper: "Improving the efficiency of Euclidean TSP solving in Constraint Programming by predicting effective nocrossing constraints" (Elena Bellodi, Alessandro Bertagnon, Marco ...

This repository contains the lab exercises from the Constraint Logic Programming course at the University of Macedonia. The exercises were implemented using Prolog and cover various topics related to ...

Abstract: The rapid expansion of the AI market has outpaced the development of adequate regulations and guidelines, resulting in deficiencies in tools for practitioners and stakeholders in AI systems ...

Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...

Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...

This is a preview. Log in through your library . Abstract The hyperbolic (or fractional) linear programming problem with only one aggregate constraint is solved by a simple and extremely efficient ...