Login / Signup

A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem.

Roberto D. GalvãoLuis Gonzalo Acosta EspejoBrian Boffey
Published in: Eur. J. Oper. Res. (2000)
Keyphrases
  • lower bound
  • upper bound
  • lagrangean relaxation
  • linear programming
  • column generation
  • real world
  • branch and bound
  • location information
  • data sets
  • decision trees
  • special case
  • np hard