20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Set TSP Problem: Combinatorial Optimization, Traveling Salesman Problem, Singleton -

English
2026-03-15
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! In combinatorial optimization, the set TSP, also known as the, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman Problem, is a generalization of the Traveling salesman problem (TSP), whereby it is required to find a shortest tour in a graph which visits all specified disjoint subsets of the vertices of a graph. The ordinary TSP is a special cas ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In combinatorial optimization, the set TSP, also known as the, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman Problem, is a generalization of the Traveling salesman problem (TSP), whereby it is required to find a shortest tour in a graph which visits all specified disjoint subsets of the vertices of a graph. The ordinary TSP is a special case of the set TSP when all subsets to be visited are singletons. Therefore the set TSP is also NP-hard.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131161667
Write Your Own Review
You're reviewing: Set TSP Problem: Combinatorial Optimization, Traveling Salesman Problem, Singleton
Your Rating:

Goodreads Reviews

€133.57 €166.96