Login / Signup

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.

Eduardo UchoaRicardo FukasawaJens LysgaardArtur Alves PessoaMarcus Poggi de AragãoDiogo Andrade
Published in: Math. Program. (2008)
Keyphrases
  • database
  • case study
  • computationally efficient
  • data mining
  • machine learning
  • social networks
  • traveling salesman problem
  • robust optimization
  • weighted least squares