CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem. Zha, A., Gao, R., Chang, Q., Koshimura, M., & Noda, I. In 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 285–292, 2020. IEEE.
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/ictai/ZhaGCKN20,
  author       = {Aolong Zha and
                  Rongxuan Gao and
                  Qiong Chang and
                  Miyuki Koshimura and
                  Itsuki Noda},
  title        = {{CNF} Encodings for the Min-Max Multiple Traveling Salesmen Problem},
  booktitle    = {32nd {IEEE} International Conference on Tools with Artificial Intelligence,
                  {ICTAI} 2020, Baltimore, MD, USA, November 9-11, 2020},
  pages        = {285--292},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/ICTAI50040.2020.00053},
  doi          = {10.1109/ICTAI50040.2020.00053},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ictai/ZhaGCKN20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0