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 is a preview. Log in through your library . Abstract In the present paper a procedure, in two phases is developed for maximizing a linear fractional functionals subject to one quadratic and a ...

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