Login / Signup

Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier.

Mehdi Amiri-ArefSaber ShiripourDiego Ruiz-Hernández
Published in: Comput. Oper. Res. (2021)
Keyphrases
  • exact and approximate
  • rendezvous search
  • lower bound
  • string matching
  • search algorithm
  • query evaluation
  • branch and bound
  • dynamic programming
  • ground plane
  • lower and upper bounds
  • optimal solution