Login / Signup

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems.

Eduardo Álvarez-MirandaMarkus Sinnl
Published in: Comput. Oper. Res. (2017)
Keyphrases
  • spanning tree
  • np complete
  • dynamic programming
  • input image
  • numerical methods