Login / Signup

A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order.

Xavier CabezasSergio García
Published in: J. Oper. Res. Soc. (2023)
Keyphrases
  • lagrangian relaxation
  • integer programming
  • feasible solution
  • data mining
  • lower bound
  • dynamic programming
  • upper bound
  • np complete
  • dual decomposition