Login / Signup

Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem.

Claudia SchlebuschStefan Irnich
Published in: OR (2014)
Keyphrases
  • lower bound
  • cover inequalities
  • memetic algorithm
  • multimedia
  • lower and upper bounds
  • real time
  • data sets
  • data mining
  • user interface
  • markov random field
  • routing problem