Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem Traveling_Salesman — Constraint detection

The traveling salesman problem -LRB- TSP -RRB- is a classic problem in combinatorial optimization . The goal is to find the shortest tour around a set of cities that visits each city exactly once and returns to the starting point .

Problem Traveling_Salesman — Detection of the decisions and objects to be modeled

The traveling salesman problem -LRB- TSP -RRB- is a classic problem in combinatorial optimization . The goal is to find the shortest tour around a set of cities that visits each city exactly once and returns to the starting point .

Back to list