HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Author:Rongxuan Gao

Publications
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
Aolong Zha, Rongxuan Gao, Qiong Chang, Miyuki Koshimura and Itsuki Noda
EasyChair Preprint 3290
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
Aolong Zha, Rongxuan Gao, Qiong Chang, Miyuki Koshimura and Itsuki Noda
EasyChair Preprint 3290

Keyphrases

Boolean satisfiability, min-max optimization, Multiple traveling salesmen problem.

Copyright © 2012-2025 easychair.org. All rights reserved.