Comparative Analysis of Capacitated Arc Routing Formulations for Branch-Cut-and-Price Algorithms

@inproceedings{Pecin2017ComparativeAO,
  title={Comparative Analysis of Capacitated Arc Routing Formulations for Branch-Cut-and-Price Algorithms},
  author={Diego Pecin and Eduardo Uchoa},
  year={2017}
}
The current best exact algorithms for the Capacitated Arc Routing Problem are based on the combination of cut and column generation. This work presents a deep theoretical investigation of the formulations behind those algorithms, classifying them and pointing similarities and differences, advantages and disadvantages. In particular, we discuss which families of cuts and branching strategies are suitable for each alternative and their pricing complexities. That analysis is used for justifying… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 43 REFERENCES

Improved lower bounds using lm-SRCs for the capacitated arc routing problems

R. Martinelli, M. Malta, M. Poggi
  • Presentation in International Workshop on Column Generation
  • 2016
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…