Muutke küpsiste eelistusi

Network Optimization Problems: Algorithms, Applications And Complexity [Kõva köide]

Edited by (Univ Of Texas At Dallas, Usa), Edited by (Univ Of Florida, Usa)
  • Formaat: Hardback, 416 pages
  • Sari: Series On Applied Mathematics 2
  • Ilmumisaeg: 01-Apr-1993
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • ISBN-10: 9810212771
  • ISBN-13: 9789810212773
  • Kõva köide
  • Hind: 150,08 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 200,10 €
  • Säästad 25%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 3-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Raamatukogudele
  • Formaat: Hardback, 416 pages
  • Sari: Series On Applied Mathematics 2
  • Ilmumisaeg: 01-Apr-1993
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • ISBN-10: 9810212771
  • ISBN-13: 9789810212773
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.

Arvustused

"This volume reflects the wide spectrum of recent research activities in the design and analysis of algorithms and the applications of networks." M M Kostreva Journal of Global Optimization, 1994