FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Time-Varying Network Optimization

Dan Sha, C. K. Wong
    Product form
      FORMAT: Hardback

      R 1,546.37 Price and availability exclusive to website

      YOU COULD EARN 1,546.37 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 257.72 per month!
      3x monthly payments of R 515.45 with
      4x fortnightly payments of R 386.59 with
      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.
      Format: CONTRIBUTORS: Dan Sha, C. K. Wong EAN: 9780387712147 COUNTRY: United States PAGES: WEIGHT: 535 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2007-05-04 CITY: GENRE: BUSINESS & ECONOMICS / Operations Research, COMPUTERS / Online Services, COMPUTERS / Networking / Hardware, MATHEMATICS / Applied WIDTH: 155 cm SPINE:

      Book Themes:

      Management decision making, Operational research, Optimization, Network hardware, Applied computing

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.
      Format: CONTRIBUTORS: Dan Sha, C. K. Wong EAN: 9780387712147 COUNTRY: United States PAGES: WEIGHT: 535 g HEIGHT: 235 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2007-05-04 CITY: GENRE: BUSINESS & ECONOMICS / Operations Research, COMPUTERS / Online Services, COMPUTERS / Networking / Hardware, MATHEMATICS / Applied WIDTH: 155 cm SPINE:

      Book Themes:

      Management decision making, Operational research, Optimization, Network hardware, Applied computing

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account