Books > Computing & IT > Computer programming
|
Buy Now
Arc Routing - Theory, Solutions and Applications (Hardcover, 2000 ed.)
Loot Price: R12,445
Discovery Miles 124 450
|
|
Arc Routing - Theory, Solutions and Applications (Hardcover, 2000 ed.)
Expected to ship within 10 - 15 working days
|
Arc Routing: Theory, Solutions and Applications is about arc
traversal and the wide variety of arc routing problems, which has
had its foundations in the modern graph theory work of Leonhard
Euler. Arc routing methods and computation has become a fundamental
optimization concept in operations research and has numerous
applications in transportation, telecommunications, manufacturing,
the Internet, and many other areas of modern life. The book draws
from a variety of sources including the traveling salesman problem
(TSP) and graph theory, which are used and studied by operations
research, engineers, computer scientists, and mathematicians. In
the last ten years or so, there has been extensive coverage of arc
routing problems in the research literature, especially from a
graph theory perspective; however, the field has not had the
benefit of a uniform, systematic treatment. With this book, there
is now a single volume that focuses on state-of-the-art exposition
of arc routing problems, that explores its graph theoretical
foundations, and that presents a number of solution methodologies
in a variety of application settings. Moshe Dror has succeeded in
working with an elite group of ARC routing scholars to develop the
highest quality treatment of the current state-of-the-art in arc
routing.
General
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!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.