CNF Encodings for the Min-Max Multiple Traveling Salesmen ProblemEasyChair Preprint no. 3290, version historyKeyphrases: Boolean satisfiability, min-max optimization, Multiple traveling salesmen problem |
| |
Copyright © 2012-2024 easychair.org. All rights reserved. |