"CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem."

Aolong Zha et al. (2020)

> Home

Details and statistics

DOI: 10.1109/ICTAI50040.2020.00053

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ictai/ZhaGCKN20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictai/ZhaGCKN20
Aolong Zha, Rongxuan Gao, Qiong Chang, Miyuki Koshimura, Itsuki Noda:
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem. ICTAI 2020: 285-292

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.