Skip to main content

Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.

Save up to 30% on print and eBooks.

Network Routing

  • 1st Edition, Volume 8 - October 30, 1995
  • Editors: M.O. Ball, T.L. Magnanti, B.L. Monma, George L. Nemhauser
  • Language: English
  • Hardback ISBN:
    9 7 8 - 0 - 4 4 4 - 8 2 1 4 1 - 6

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. Ho… Read more

Network Routing

Purchase options

LIMITED OFFER

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code is needed.

Institutional subscription on ScienceDirect

Request a sales quote

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.