Time-varying network optimization

Author(s)

    • Cai, Xiaoqiang
    • Sha, Dan
    • Wong, C. K.

Bibliographic Information

Time-varying network optimization

Xiaoqiang Cai, Dan Sha, C.K. Wong

(International series in operations research & management science, 103)

Springer, c2007

  • : Softcover

Available at  / 6 libraries

Search this Book/Journal

Note

Includes bibliographical references (p. [207]-217) and index

Description and Table of Contents

Description

This text describes a series of models, propositions, and algorithms developed in recent years on time-varying networks. References and discussions on relevant problems and studies that have appeared in the literature are integrated in the book. Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem. While these topics are examined within the framework of time-varying networks, each chapter is self-contained so that each can be read - and used - separately.

Table of Contents

Time-Varying Shortest Path Problems.- Time-Varying Minimum Spanning Trees.- Time-Varying Universal Maximum Flow Problems.- Time-Varying Minimum Cost Flow Problems.- Time-Varying Maximum Capacity Path Problems.- The Quickest Path Problem.- Finding the Best Path with Multi-Criteria.- Generalized Flows and Other Network Problems.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top