Login / Signup

Counting and enumerating feasible rotating schedules by means of Gröbner bases.

Raúl M. FalcónEva BarrenaDavid CancaGilbert Laporte
Published in: Math. Comput. Simul. (2016)
Keyphrases
  • numerically stable
  • real time
  • data mining
  • polynomial equations
  • data sets
  • databases
  • neural network
  • machine learning
  • data structure
  • feasible solution