CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem

EasyChair Preprint no. 3290, version history

Aolong Zha, Rongxuan Gao, Qiong Chang, Miyuki Koshimura and Itsuki Noda

Version	Date	Pages	Version notes
1	April 28, 2020	17	—
2	November 11, 2020	8	This version is accepted by ICTAI 2020 (CSP/SAT track).

Keyphrases: Boolean satisfiability, min-max optimization, Multiple traveling salesmen problem

BibTeX entry

BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:

@Booklet{EasyChair:3290,
  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},
  howpublished = {EasyChair Preprint no. 3290},

  year = {EasyChair, 2020}}