Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

Pierre Coste, Andrea Lodi 0001, Gilles Pesant. Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. In Louis-Martin Rousseau, Kostas Stergiou 0001, editors, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings. Volume 11494 of Lecture Notes in Computer Science, pages 182-191, Springer, 2019. [doi]

@inproceedings{Coste0P19,
  title = {Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems},
  author = {Pierre Coste and Andrea Lodi 0001 and Gilles Pesant},
  year = {2019},
  doi = {10.1007/978-3-030-19212-9_12},
  url = {https://doi.org/10.1007/978-3-030-19212-9_12},
  researchr = {https://researchr.org/publication/Coste0P19},
  cites = {0},
  citedby = {0},
  pages = {182-191},
  booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings},
  editor = {Louis-Martin Rousseau and Kostas Stergiou 0001},
  volume = {11494},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-19212-9},
}