Network Routing, Volume 8 (Hardcover)

The papers in this volume consider a general area of study known as network routing. The underlying problems are conceptually simple, yet mathematically complex and challenging. How can we best route material or people from one place to another? Or, how can we best design a system (for instance locate facilities) to provide services and goods as efficiently and equitably as possible? The problems encountered in answering these questions often have an underlying combinatorial structure, for example, either we dispatch a vehicle or we do not, or we use one particular route or another. The problems also typically have an underlying network structure (a communication or transportation network). In addition, models for these problems are often very large with hundreds or thousands of constraints and variables. A companion volume in the "Handbook" series, entitled "Network Models", treats basic network models such as minimum cost flows, matching and the travelling salesman problem, as well as, several complex network topics, not directly related to routing, such as network design and network reliability.

General

Imprint:	Elsevier Science Ltd
Country of origin:	United Kingdom
Series:	Handbooks in Operations Research and Management Science
Release date:	October 1995
First published:	1995
Series editors:	M.O. Ball • T.L. Magnanti • B. L. Monma • George L. Nemhauser
Dimensions:	254 x 178mm (L x W)
Format:	Hardcover
Pages:	796
ISBN-13:	978-0-444-82141-6
Categories:	Books > Reference & Interdisciplinary > Communication studies > General Books > Computing & IT > Computer communications & networking > General Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	0-444-82141-4
Barcode:	9780444821416

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!