HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Author:Qiong Chang

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
An Incremental SAT-Based Approach for Solving the Real-Time Taxi-Sharing Service Problem
Aolong Zha, Qiong Chang and Itsuki Noda
EasyChair Preprint 3285
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
Aolong Zha, Rongxuan Gao, Qiong Chang, Miyuki Koshimura and Itsuki Noda
EasyChair Preprint 3290
An Incremental SAT-Based Approach for Solving the Real-Time Taxi-Sharing Service Problem
Aolong Zha, Qiong Chang and Itsuki Noda
EasyChair Preprint 3285

Keyphrases

Boolean satisfiability, combinatorial optimization, min-max optimization, Multiple traveling salesmen problem, route planning, Taxi sharing.

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