Skip to main content
SpringerLink
Log in

Time-Varying Network Optimization

  • Textbook
  • © 2007

Overview

Authors:
  1. Xiaoqiang Cai

    1. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Dan Sha

    1. Business School, Shanghai Institute of Foreign Trade, Shanghai

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. C. K. Wong

    1. Department of Computer Science, The Chinese University of Hong Kong, Hong Kong

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Addresses two types of needs in the research of network optimization: 1) to present the latest research efforts and findings on time-varying network optimization; and 2) to examine key models and results on dynamic network optimization problems that can be used by academics, practitioners, and graduate students or senior-year undergraduate students
  • There is a great need to seek optimal solutions on these types of time-varying networks. This has become particularly relevant and important in those complicated networks in the changing environments today, such as transportation networks, telecommunication networks, and the Internet – this book treats these problems
  • The Ahuja, Magnati & Orlin Network Flows textbook for Prentice Hall (1993) is the single dominant book in the market; however, it treats only static network optimization flows. Cai et al is the first systematic treatment of time-varying models and algorithms in network optimization. As such, it will be a book of which the entire optimization community across the Applied Sciences will have considerable interest
  • Includes supplementary material: sn.pub/extras

Part of the book series: International Series in Operations Research & Management Science (ISOR, volume 103)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Time-Varying Shortest Path Problems

    Pages 1-26

  3. Time-Varying Minimum Spanning Trees

    Pages 27-67

  4. Time-Varying Universal Maximum Flow Problems

    Pages 69-105

  5. Time-Varying Minimum Cost Flow Problems

    Pages 107-134

  6. Time-Varying Maximum Capacity Path Problems

    Pages 135-149

  7. The Quickest Path Problem

    Pages 151-165

  8. Finding the Best Path with Multi-Criteria

    Pages 167-174

  9. Generalized Flows and Other Network Problems

    Pages 175-206

  10. Back Matter

    Pages 207-226
    Download chapter PDF
Back to top

Keywords

About this book

Network ?ow optimization problems may arise in a wide variety of important ?elds, such as transportation, telecommunication, computer networking, ?nancial planning, logistics and supply chain management, energy systems, etc. Signi?cant and elegant results have been achieved onthetheory,algorithms,andapplications,ofnetwork?owoptimization in the past few decades; See, for example, the seminal books written by Ahuja, Magnanti and Orlin (1993), Bazaraa, Jarvis and Sherali (1990), Bertsekas (1998), Ford and Fulkerson (1962), Gupta (1985), Iri (1969), Jensen and Barnes (1980), Lawler (1976), and Minieka (1978). Most network optimization problems that have been studied up to date are, however, static in nature, in the sense that it is assumed that it takes zero time to traverse any arc in a network and that all attributes of the network are constant without change at any time. Networks in the real world are, nevertheless, time-varying in essence, in which any ?ow must take a certain amount of time to traverse an arc and the network structure and parameters (such as arc and node capacities) may change over time. In such a problem, how to plan and control the transmission of ?ow becomes very important, since waiting at a node, or travelling along a particular arc with di?erent speed, may allow one to catch the best timing along his path, and therefore achieve his overall objective, such as a minimum overall cost or a minimum travel time from the origin to the destination.

Reviews

From the reviews:

"This monograph provides a unified framework for a series of models and algorithms to study flow optimization problems in time-varying networks. … the topics covered by this monograph make it useful for graduate students as a textbook and are of interest for engineers and researchers working on time-varying network optimization problems." (Francesc Comellas, Mathematical Reviews, Issue 2009 b)

Authors and Affiliations

  • Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong

    Xiaoqiang Cai

  • Business School, Shanghai Institute of Foreign Trade, Shanghai

    Dan Sha

  • Department of Computer Science, The Chinese University of Hong Kong, Hong Kong

    C. K. Wong

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation