Combinatorial optimization theoretical computer (31 Ergebnisse)

Zustand: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

hardcover. Zustand: Gut. Seiten; 9780821802397.3 Gewicht in Gramm: 2.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Zustand: New. 1st ed. 2018 edition NO-PA16APR2015-KAP.

Zustand: Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In poor condition, suitable as a reading copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9783540668602.…

Paperback. Zustand: Brand New. 2010 edition. 302 pages. 9.25x6.25x0.75 inches. In Stock.

Zustand: New. In English.

Paperback. Zustand: Brand New. 2010 edition. 380 pages. 9.25x6.25x1.00 inches. In Stock.

Paperback. Zustand: Brand New. 466 pages. 9.25x6.25x1.00 inches. In Stock.

Zustand: New. 1st ed. 2018 edition NO-PA16APR2015-KAP.

hardcover. Zustand: Befriedigend. 505 Seiten; 9783540668602.4 Gewicht in Gramm: 1.

Zustand: New. pp. 430 1st ed. 2018 edition NO-PA16APR2015-KAP.

Zustand: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

paperback. Zustand: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: New. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

Zustand: New. Dedicated to the theme 'Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives', this title shows that bringing together operational research and theoretical computer science can yield useful results for a range of applications, and demonstrates the quality and range of research conducted by LAMSADE in these areas. Editor(s): Paschos, Vangelis Th. Series: ISTE. Num Pages: 544 pages, Illustrations. BIC Classification: UY. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 241 x 165 x 33. Weight in Grams: 910. . 2008. 1st Edition. Hardcover. . . . .…

Zustand: New. Brand new! Please provide a physical shipping address.

Gebunden. Zustand: New. Dedicated to the theme Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives , this title shows that bringing together operational research and theoretical computer science can yield useful results for a range of applicatio.

Zustand: New. Dedicated to the theme 'Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives', this title shows that bringing together operational research and theoretical computer science can yield useful results for a range of applications, and demonstrates the quality and range of research conducted by LAMSADE in these areas. Editor(s): Paschos, Vangelis Th. Series: ISTE. Num Pages: 544 pages, Illustrations. BIC Classification: UY. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 241 x 165 x 33. Weight in Grams: 910. . 2008. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.…

Buch. Zustand: Neu. Neuware - This volume is dedicated to the theme 'Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives' and has two main objectives: the first is to show that bringing together operational research and theoretical computer science can yield useful results for a range of applications, while the second is to demonstrate the quality and range of research conducted by the LAMSADE in these areas.…

Zustand: Wie neu. Gebraucht - Wie neu Wie neu, Importqualität, auf Lager - High Quality Content by WIKIPEDIA articles! The Travelling Salesman Problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved.…

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Zustand: New. Print on Demand pp. 430.

Zustand: New. PRINT ON DEMAND pp. 430.

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The Travelling Salesman Problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved.…