Marknadens största urval
Snabb leverans

The Traveling Salesman Problem and Its Variations

Om The Traveling Salesman Problem and Its Variations

The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9780387444598
  • Format:
  • Häftad
  • Sidor:
  • 830
  • Utgiven:
  • 18. maj 2007
  • Utgåva:
  • Mått:
  • 158x234x49 mm.
  • Vikt:
  • 1228 g.
Leveranstid: 2-4 veckor
Förväntad leverans: 4. december 2024

Beskrivning av The Traveling Salesman Problem and Its Variations

The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.

Användarnas betyg av The Traveling Salesman Problem and Its Variations



Hitta liknande böcker
Boken The Traveling Salesman Problem and Its Variations finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.