Optimization Algorithms for Networks and Graphs / Edition 2

by James Evans

Overview

A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm

Product Details

ISBN-13:	9780367402808
Publisher:	Taylor & Francis
Publication date:	09/11/2019
Edition description:	2nd ed.
Pages:	488
Product dimensions:	7.00(w) x 9.00(h) x 1.10(d)

Table of Contents

Introduction to Graphs and Networks Computer Representation and Solution Tree Algorithms Shortest-Path Algorithms Minimum-Cost Flow Algorithms Matching and Assignment Algorithms The Postman and Related Arc Routing Problems The Traveling Salesman and Related Vertex Routing Problems Location Problems Project Networks NETSOLVE User's Manual

Editorial Reviews

". . .a must for the student with an interest in network optimization and a valuable addition to the library of any researcher in the area. "
—-Interfaces
"Includes new material based on developments since the First Edition, a new chapter on computer representation of graphs and computational complexity issues, and a software (NETSOLVE) for IBM PCs and compatibles. "
—-The American Mathematical Monthly

From the Publisher

...a must for the student with an interest in network optimization and a valuable addition to the library of any researcher in the area.

Interfaces

Includes new material based on developments since the First Edition, a new chapter on computer representation of graphs and computational complexity issues, and a software (NETSOLVE for IBM PCs and compatibles.

American Mathematical Monthly

A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithms have been developed. The original chapters have been expanded and updated; a new chapter has been added on computer representation, algorithms, heuristics, and computational complexity; and a computer software package, NETSOLVE (disk included), has been integrated with the text. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews