Network Optimization: Chapman Hall/CRC Mathematics Series
Autor V. Balakrishnanen Limba Engleză Hardback – apr 1995
Preț: 408.20 lei
Preț vechi: 529.95 lei
-23% Nou
Puncte Express: 612
Preț estimativ în valută:
78.13€ • 81.43$ • 65.04£
78.13€ • 81.43$ • 65.04£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780412556708
ISBN-10: 0412556707
Pagini: 256
Dimensiuni: 156 x 234 x 17 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Chapman Hall/CRC Mathematics Series
ISBN-10: 0412556707
Pagini: 256
Dimensiuni: 156 x 234 x 17 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Chapman Hall/CRC Mathematics Series
V-ar putea interesa
-
Schaum's Outline of CombinatoricsV. Balakrishnan-16%Preț: 140.36 lei166.74 lei -
-20%Preț: 152.67 lei190.14 lei -
-27%Preț: 484.49 lei663.09 lei -
Information Orientation: The Link to Business PerformanceDonald A. Marchand-31%Preț: 571.55 lei829.05 lei -
Balanced Scorecard Strategy For DummiesC HannabargerPreț: 97.95 lei -
-8%Preț: 409.30 lei444.90 lei -
Preț: 312.45 lei -
Preț: 321.44 lei -
MBA Management ModelsSue Harding-17%Preț: 257.10 lei310.68 lei -
Preț: 122.14 lei -
-26%Preț: 849.33 lei1144.26 lei -
-23%Preț: 445.12 lei576.61 lei -
-26%Preț: 552.27 lei742.63 lei -
The Appreciative Inquiry Handbook. For Leaders of ChangeDavid Cooperrider-33%Preț: 310.74 lei460.70 lei -
-16%Preț: 250.10 lei298.49 lei
Public țintă
ProfessionalCuprins
Preface
Trees, arborescences and branchings
Transshipment problems
Shortest path problems
Minimum cost flow problems
Matching in graphs
References
Solutions to selected problems
Index
Trees, arborescences and branchings
Transshipment problems
Shortest path problems
Minimum cost flow problems
Matching in graphs
References
Solutions to selected problems
Index
Descriere
Topics include optimal branching problems, trans-shipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs, and applications to combinatorics.