On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
scientific article; zbMATH DE number 1829878