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

A method is given for maximizing a linear function subject to a quadratic and a number of linear constraints. The method differs from general convex programming methods by terminating in a finite ...

Mathematical Programming with Vanishing Constraints Publication Trend The graph below shows the total number of publications each year in Mathematical Programming with Vanishing Constraints.