Now showing items 1-1 of 1

    • Icon

      Counting and enumerating feasible rotating schedules by means of Gröbner bases  [Article]

      Falcón Ganfornina, Raúl Manuel; Barrena Algara, Eva; Canca Ortiz, José David; Laporte, Gilbert (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 ...