Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

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

angļu valoda
2026-03-15
109,28 € 182,14 €

-40% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

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 ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786131161667
Rakstiet savu atsauksmi
Jūs vērtējat: Set TSP Problem: Combinatorial Optimization, Traveling Salesman Problem, Singleton
Jūsu novērtējums:

Goodreads atsauksmes

109,28 € 182,14 €