Produktbild 1
49,00 €
inkl. MwSt.
versandkostenfrei

1

lieferbar in 1-3 Werktagen

The Travelling Salesman Problem (TSP) is one of the problem, which has been addressed extensively by mathematicians, computer scientists and researchers. Since TSP finds its applications in real world problems viz., VLSI design, Art works, World tours, etc., finding an optimal solution to TSP will be a significant work as it will give better results for many TSP related applications. There are several methods and techniques to solve TSP. One of the best approaches to find an optimal solution to ...

R. Geetha Ramani
Weiterempfehlen:

DETAILS

  • Travelling Salesman Problem(TSP)optimization through Genetic Algorithm
  • Improvised solution to VLSI Detailed Routing and National Tour
  • Ramani, R. Geetha
  • Kartoniert, 116 S.
  • Sprache: Englisch
  • 220 mm
  • ISBN-13: 978-3-639-30797-9
  • Titelnr.: 31034282
  • Gewicht: 171 g
  • VDM Verlag Dr. Müller (2011)
  • Herstelleradresse

    VDM Verlag Dr. Müller

    Brivibas gatve 197

    1039 - LV Riga

    E-Mail: customerservice@vdm-vsg.de

Bewertungen (0)
Jetzt bewerten

Mehr von R. Geetha Ramani

Gesamtsummeinkl. MwSt.

Sie haben bisher keine Artikel in deinen Warenkorb gelegt. Bitte verwenden Sie hierfür den Button 'kaufen'.