This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive ...

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

With the rapid development of artificial intelligence technology, AI-driven learning methods are gradually permeating various fields, particularly evident in programming education. In recent years, ...

The open-source project behind Julia, a programming language for data scientists, has revealed which languages users would shift to if they decided no longer to use Julia. Julia, a zippy programming ...

Cell suppression is a widely used technique for protecting sensitive information in statistical data presented in tabular form. Previous works on the subject mainly concentrate on 2- and 3-dimensional ...