Combinatorial optimization (CO) underpins critical applications in science and engineering, ranging from logistics to electronic design automation. A classic example of CO is the NP-complete Traveling ...
The Traveling Salesman Problem (TSP) is one of the most studied combinatorial optimization problems 1. That is driven by its theoretical significance and applicability in various fields such as ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results