Optimization Theory: Recent Developments from Mátraháza: Applied Optimization, cartea 59
Editat de F. Giannessi, Panos M. Pardalos, Tamás Rapcsáken Limba Engleză Paperback – 17 sep 2011
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 615.52 lei 6-8 săpt. | |
| Springer Us – 17 sep 2011 | 615.52 lei 6-8 săpt. | |
| Hardback (1) | 621.48 lei 6-8 săpt. | |
| Springer Us – 31 oct 2001 | 621.48 lei 6-8 săpt. |
Din seria Applied Optimization
- 18%
Preț: 1185.68 lei -
Preț: 122.67 lei - 15%
Preț: 618.50 lei - 18%
Preț: 1183.54 lei - 20%
Preț: 941.67 lei - 15%
Preț: 613.62 lei - 15%
Preț: 621.67 lei - 18%
Preț: 1073.46 lei - 15%
Preț: 614.11 lei - 15%
Preț: 618.99 lei - 15%
Preț: 616.15 lei - 20%
Preț: 956.44 lei - 15%
Preț: 625.26 lei - 18%
Preț: 917.09 lei - 18%
Preț: 1192.50 lei - 18%
Preț: 1178.53 lei - 18%
Preț: 1187.36 lei - 18%
Preț: 1180.03 lei - 18%
Preț: 1183.40 lei - 18%
Preț: 922.11 lei - 15%
Preț: 577.14 lei - 15%
Preț: 629.35 lei - 18%
Preț: 916.33 lei - 18%
Preț: 912.40 lei - 15%
Preț: 617.89 lei - 15%
Preț: 618.50 lei - 15%
Preț: 616.95 lei
Preț: 615.52 lei
Preț vechi: 724.14 lei
-15% Nou
Puncte Express: 923
Preț estimativ în valută:
108.92€ • 127.02$ • 95.63£
108.92€ • 127.02$ • 95.63£
Carte tipărită la comandă
Livrare economică 15-29 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461379836
ISBN-10: 1461379830
Pagini: 292
Ilustrații: VIII, 280 p.
Dimensiuni: 160 x 240 x 15 mm
Greutate: 0.41 kg
Ediția:2001
Editura: Springer Us
Colecția Springer
Seria Applied Optimization
Locul publicării:New York, NY, United States
ISBN-10: 1461379830
Pagini: 292
Ilustrații: VIII, 280 p.
Dimensiuni: 160 x 240 x 15 mm
Greutate: 0.41 kg
Ediția:2001
Editura: Springer Us
Colecția Springer
Seria Applied Optimization
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Heuristics for the Process Network Synthesis Problem.- Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem.- Lower and Upper Bounds on the Probability of the Union of Some Events with Applications.- The Linear Complementarity Problem and the Class of Generalized Positive Subdefinite Matrices.- Computer Experiences with Successive Regression Approximations for Solving Equations.- A Bundle of Smooth Lagrangians in Mathematical Programming.- A Nontopological Two-function Minimax Theorem with Monotone Ttansformations of the Functional Values.- Non-smooth Optimization with Randomization.- The Sherman-Morrison Formula for the Determinant and its Application for Optimizing Quadratic Functions on Condition Sets Given by Extreme Generators.- Duality For D.C. Optimization Over Compact Sets.- Characterization of Monotone Operators by Using a Special Class of Preinvex Functions.- Two Approaches for Parallelizing the UEGO Algorithm.- Convexification of Functions by Nonlinear Coordinate Transformations.- Packing Equal Circles in a Square I. — Problem Setting and Bounds for Optimal Solutions.- Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm.- On Duality for Quasi-convex Supremization and Reverse Convex Infimization.- A Minimization Problem in Function Spaces.