Buscar
Mostrando ítems 1-2 de 2
Artículo
Counting and enumerating feasible rotating schedules by means of Gröbner bases
(Elsevier, 2016)
This paper deals with the problem of designing and analyzing rotating schedules with an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely identified with ...
Artículo
Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
(Elsevier Ltd., 2024-06)
We analyze several time dependency issues for the selective traveling salesman problem with time-dependent profits. Specifically, we consider the case in which the profit collected at a vertex depends on the service time, ...