Login / Signup

A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem.

Marcos Roberto SilvaClaudio Barbieri da Cunha
Published in: Eur. J. Oper. Res. (2017)
Keyphrases
  • location problems
  • lot sizing
  • network design problem
  • upper bound
  • bayesian networks
  • tabu search
  • vehicle routing problem
  • timetabling problem