| Title:
|
NETWORK OPTIMIZATION PROBLEMS: ALGORITHMS, APPLICATIONS AND COMPLEXITY
|
| By: |
Ding-Zhu Du (Editor), Panos M. Pardalos (Editor) |
| Format: |
Hardback |
| List price:
|
£146.00 |
| Our price: |
£131.40 |
| Discount: |
|
| You save:
|
£14.60 |
|
|
|
|
|
| ISBN 10: |
9810212771 |
| ISBN 13: |
9789810212773 |
| Availability: |
Reprinting. This item may be subject to delays or cancellation.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
WORLD SCIENTIFIC PUBLISHING CO PTE LTD |
| Pub. date: |
1 April, 1993 |
| Series: |
Series On Applied Mathematics 2 |
| Pages: |
416 |
| Description: |
The purpose of this book is to cover a spectrum of developments in network optimization problems, from linear networks to general nonconvex network flow problems. |
| Synopsis: |
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in VLSI design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems. |
| Publication: |
Singapore |
| Imprint: |
World Scientific Publishing Co Pte Ltd |
| Returns: |
Returnable |