Anbieter: Qwertyword Ltd, Okehampton, DEVON, Vereinigtes Königreich
EUR 11,28
Anzahl: 1 verfügbar
In den WarenkorbSoft cover. Zustand: As New. All clean and crisp with no marks or inscriptions.
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 28,59
Anzahl: 1 verfügbar
In den WarenkorbZustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,400grams, ISBN:9781898563914.
Sprache: Englisch
Verlag: Woodhead Publishing 2003-01-01, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 64,67
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardcover. Zustand: New.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 72,31
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. illustrated edition. 200 pages. 9.25x6.25x0.25 inches. In Stock.
Sprache: Englisch
Verlag: Elsevier Science & Technology, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 80,70
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: New. New copy - Usually dispatched within 4 working days.
Anbieter: BennettBooksLtd, Los Angeles, CA, USA
Hardcover. Zustand: New. In shrink wrap. Looks like an interesting title!
Taschenbuch. Zustand: Neu. Networks and Graphs | Techniques and Computational Methods | D K Smith | Taschenbuch | Englisch | 2003 | Elsevier Science | EAN 9781898563914 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Dr Smith here presents essential mathematical and computational ideas of network optimisation for senior undergraduate and postgraduate students in mathematics, computer science and operational research. He shows how algorithms can be used for finding optimal paths and flows, identifying trees in networks, and optimal matching. Later chapters discuss postman and salesperson tours, and demonstrate how many network problems are related to the ''minimal-cost feasible-flow'' problem. Techniques are presented both informally and with mathematical rigour and aspects of computation, especially of complexity, have been included. Numerous examples and diagrams illustrate the techniques and applications. The book also includes problem exercises with tutorial hints.