Cantitate/Preț
Produs

Flows in Networks: Princeton Landmarks in Mathematics and Physics

Autor Lester Randolph Ford, D. R. Fulkerson
en Limba Engleză Paperback – 15 feb 2016
This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics. Originally published in 1962. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 31255 lei  3-5 săpt.
  Princeton University Press – 15 feb 2016 31255 lei  3-5 săpt.
Hardback (1) 67358 lei  6-8 săpt.
  Princeton University Press – 18 apr 2016 67358 lei  6-8 săpt.

Din seria Princeton Landmarks in Mathematics and Physics

Preț: 31255 lei

Nou

Puncte Express: 469

Preț estimativ în valută:
5981 6207$ 4999£

Carte disponibilă

Livrare economică 22 februarie-08 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780691625393
ISBN-10: 0691625395
Pagini: 212
Dimensiuni: 155 x 234 x 16 mm
Greutate: 0.3 kg
Editura: Princeton University Press
Seria Princeton Landmarks in Mathematics and Physics


Descriere

Descriere de la o altă ediție sau format:
This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for person