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) | 640.24 lei 6-8 săpt. | |
Springer Us – 17 sep 2011 | 640.24 lei 6-8 săpt. | |
Hardback (1) | 646.43 lei 6-8 săpt. | |
Springer Us – 31 oct 2001 | 646.43 lei 6-8 săpt. |
Din seria Applied Optimization
- Preț: 127.66 lei
- 15% Preț: 643.34 lei
- 18% Preț: 1231.47 lei
- 20% Preț: 979.71 lei
- 15% Preț: 638.24 lei
- 15% Preț: 646.62 lei
- 18% Preț: 1116.89 lei
- 15% Preț: 638.76 lei
- 15% Preț: 643.84 lei
- 15% Preț: 640.88 lei
- 20% Preț: 995.09 lei
- 15% Preț: 650.37 lei
- 18% Preț: 1233.69 lei
- 18% Preț: 954.14 lei
- 18% Preț: 1240.79 lei
- 18% Preț: 1226.24 lei
- 18% Preț: 1235.43 lei
- 18% Preț: 1226.90 lei
- 18% Preț: 1231.32 lei
- 18% Preț: 959.36 lei
- 15% Preț: 600.26 lei
- 15% Preț: 654.62 lei
- 18% Preț: 953.35 lei
- 18% Preț: 949.23 lei
- 15% Preț: 642.68 lei
- 15% Preț: 643.34 lei
- 15% Preț: 641.71 lei
Preț: 640.24 lei
Preț vechi: 753.22 lei
-15% Nou
Puncte Express: 960
Preț estimativ în valută:
122.57€ • 126.12$ • 103.32£
122.57€ • 126.12$ • 103.32£
Carte tipărită la comandă
Livrare economică 28 februarie-14 martie
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.