Network Routing

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Hardbound. 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 (e.g. 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 a

Author(s): M. O. Ball, T. L. Magnanti, Clyde L. Monma, George L. Nemhauser
Series: Handbooks in operations research and management science 8
Publisher: Elsevier
Year: 1995

Language: English
Pages: 779
City: Amsterdam; New York