Login / Signup

Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks.

Sepideh MohammadiBehrooz AlizadehEsmaeil Afrashteh
Published in: Comput. Appl. Math. (2023)
Keyphrases
  • location problems
  • worst case
  • binary search trees
  • computational complexity
  • data structure
  • single facility
  • dynamic programming
  • complex networks