Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
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 ...
Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with content, and download exclusive resources. Ludovic Henry explains how RISC-V's open ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results