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