Da: Qwertyword Ltd, Okehampton, DEVON, Regno Unito
EUR 12,81
Quantità: 1 disponibili
Aggiungi al carrelloSoft cover. Condizione: As New. All clean and crisp with no marks or inscriptions.
EUR 28,49
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Woodhead Publishing 2003-01-01, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Da: Chiron Media, Wallingford, Regno Unito
EUR 64,44
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardcover. Condizione: New.
Lingua: Inglese
Editore: Woodhead Publishing Limited, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Da: Majestic Books, Hounslow, Regno Unito
EUR 76,78
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 204.
Da: Revaluation Books, Exeter, Regno Unito
EUR 72,05
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. illustrated edition. 200 pages. 9.25x6.25x0.25 inches. In Stock.
Lingua: Inglese
Editore: Woodhead Publishing Limited, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 204.
Lingua: Inglese
Editore: Elsevier Science & Technology, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 80,21
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Lingua: Inglese
Editore: Woodhead Publishing Limited, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 85,55
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 204.
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
Hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 65,94
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 69,95
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 204 pp. Englisch.
Lingua: Inglese
Editore: Elsevier Science & Technology|Woodhead Publishing, 2003
ISBN 10: 1898563918 ISBN 13: 9781898563914
Da: moluna, Greven, Germania
EUR 73,70
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 optim.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 78,82
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.