The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte. The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program., 121(2):269-305, 2010. [doi]

@article{DumitrescuRCL10,
  title = {The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm},
  author = {Irina Dumitrescu and Stefan Ropke and Jean-François Cordeau and Gilbert Laporte},
  year = {2010},
  doi = {10.1007/s10107-008-0234-9},
  url = {http://dx.doi.org/10.1007/s10107-008-0234-9},
  researchr = {https://researchr.org/publication/DumitrescuRCL10},
  cites = {0},
  citedby = {0},
  journal = {Math. Program.},
  volume = {121},
  number = {2},
  pages = {269-305},
}