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

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 ...

This paper shows how a stochastic programming model for least-cost feed formulations under a probabilistic protein constraint and other linear restrictions can be solved by using an iterative ...