The Traveling Salesman Problem with Profits (TSPP) is a BOCO problem that can be described as follows: let G = (V, E) be a complete undirected graph, with V = {0, 1, . . . , n} the set of nodes, and E the set of edges. Let pi be the proﬁt of node i, and let ce be the cost of edge e ∈ E. A service carrier, starting from node 0 may visit any subset of nodes. Visiting a subset S of nodes implies a proﬁt p(S) = ∑i∈S pi, and a cost c(S) which is the cost of a shortest Hamiltonian tour among the nodes in S. The carrier wishes to maximize collected proﬁt and minimize incurred cost, and thus faces a bi-objective problem.

Cardinality of the efficient set

Let us deﬁne the node proﬁts and edge costs as follows:
• pi = 2i−1 for all i = 0, 1, . . . , n;
• cij = 2j−1 for all (i, j) ∈ E with i < j.
Notice that the input size of the instance is O(n2).
It is not hard to see that with this choice of profits and costs every subset of nodes containing the depot 0 correspond to a Pareto optimal solution and thus to an efficient point in the objective space. It follows that the cardinality of the efficient frontier is O(2n), clearly exponential in the input size.
When n = 3, the instance can be depicted as follows. On the left, the blue figures are costs and the red ones are profits. On the right, the efficient set is plotted in the objective space.

Notice that the efficient set is composed by 23 = 8 points.

We shall illustrate on this example the two tasks mentioned in CONCEPTS AND CHALLENGES.

Challenge 1: given a required maximum error ε, ﬁnd a Pareto ε-approximation of minimum cardinality

In the following picture, red points form Pareto 1.50-approximation of the efficient set; shaded rectangles show regions of the objective space approximated by red points. On the left, we have an approximation with cardinality 3. Notice that the approximation is minimal, in the sense that if we remove any point we have no more a valid approximation. However, there is also 1.50-approximation with cardinality 2, shown on the right.

Challenge 2: given a maximum cardinality M, find a Pareto ε-approximation of cardinality M such that ε is minimum

Consider the following picture. On the left, we have a Pareto 0.50-approximation with cardinality 4. Again, the approximation is minimal: we cannot remove any point. Furthermore, 0.50 is the minimum error such that these 4 points form an ε-approximation. However, on the right we see that with 4 efficient points it is possible to get a Pareto 0.25-approximation of the whole efficient set.
{"ft_lang_label":"__label__en","ft_lang_prob":0.88954926,"math_prob":0.9837519,"size":2492,"snap":"2019-43-2019-47","text_gpt3_token_len":614,"char_repetition_ratio":0.15152733,"word_repetition_ratio":0.0045871558,"special_character_ratio":0.22512038,"punctuation_ratio":0.11984283,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99657303,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-15T16:43:13Z\",\"WARC-Record-ID\":\"<urn:uuid:bc05b7db-b993-49be-a0b7-9183ee9fd2b5>\",\"Content-Length\":\"30453\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b269c085-87e0-4e96-b7ab-64b5e2f42ba7>\",\"WARC-Concurrent-To\":\"<urn:uuid:42fe734a-4245-4404-9b99-8800f3b75682>\",\"WARC-IP-Address\":\"172.217.164.147\",\"WARC-Target-URI\":\"http://or-brescia.unibs.it/problems/mco/example\",\"WARC-Payload-Digest\":\"sha1:BNFZML6CZLERCEIZCT55TKWEPXE4EBG4\",\"WARC-Block-Digest\":\"sha1:YJKGZM7UT4DHD2HWDU64FIN5K6KVWA5L\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986660067.26_warc_CC-MAIN-20191015155056-20191015182556-00486.warc.gz\"}"}