Näherungsalgorithmen für reisende Verkäuferprobleme von Vera Traub
133,86 €
The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful.
Jetzt bei Ebay:
![Produktbild - Evolutionary Optimization Algorithms by Q. H. Badar, Altaf [Paperback]](https://i.ebayimg.com/thumbs/images/g/QxcAAeSwhRhoUnPN/s-l140.jpg)
![Produktbild - Wavelet Based Approximation Schemes for Singular Integral Equations [Paperback]](https://i.ebayimg.com/thumbs/images/g/heoAAeSwbjdoS4HD/s-l140.jpg)
![Produktbild - Algorithms for Emergency Medicine (Algorithms In) by Mark Harrison [Paperback]](https://i.ebayimg.com/thumbs/images/g/MPgAAeSwfSZoS2I8/s-l140.jpg)
![Produktbild - Compound Poisson Approximation by Vydas Čekanavičius [Hardback]](https://i.ebayimg.com/thumbs/images/g/k7QAAeSwaiVoTCzu/s-l140.jpg)
![Produktbild - Applied Evolutionary Algorithms for Engineers Using Python [Paperback]](https://i.ebayimg.com/thumbs/images/g/q0EAAeSw8FxoS6AQ/s-l140.jpg)
![Produktbild - Algorithms in Infertility and Reproductive Medicine by Kamini A Rao [Paperback]](https://i.ebayimg.com/thumbs/images/g/rzsAAeSwWyhnwPoK/s-l140.jpg)