Advances in Optimization and Approximation: Nonconvex Optimization and Its Applications, cartea 1
Editat de Ding-Zhu Du, Jie Sunen Limba Engleză Hardback – 31 mai 1994
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 922.46 lei 43-57 zile | |
Springer Us – 12 oct 2011 | 922.46 lei 43-57 zile | |
Hardback (1) | 928.44 lei 43-57 zile | |
Springer Us – 31 mai 1994 | 928.44 lei 43-57 zile |
Din seria Nonconvex Optimization and Its Applications
- 18% Preț: 922.46 lei
- 20% Preț: 1244.85 lei
- Preț: 385.50 lei
- 18% Preț: 1187.20 lei
- 18% Preț: 921.55 lei
- 18% Preț: 1772.16 lei
- 18% Preț: 1195.96 lei
- 18% Preț: 927.84 lei
- 18% Preț: 1510.79 lei
- 20% Preț: 968.12 lei
- 18% Preț: 1192.41 lei
- 18% Preț: 3225.52 lei
- 18% Preț: 1187.20 lei
- 15% Preț: 581.20 lei
- 18% Preț: 1188.41 lei
- 24% Preț: 1137.16 lei
- 20% Preț: 966.99 lei
- 18% Preț: 928.88 lei
- 20% Preț: 971.65 lei
- 15% Preț: 627.93 lei
- 18% Preț: 1190.72 lei
- 18% Preț: 923.38 lei
- 18% Preț: 924.93 lei
- 18% Preț: 1187.20 lei
- 18% Preț: 1778.61 lei
- 18% Preț: 1199.47 lei
- 18% Preț: 924.15 lei
Preț: 928.44 lei
Preț vechi: 1132.25 lei
-18% Nou
Puncte Express: 1393
Preț estimativ în valută:
177.70€ • 185.21$ • 147.93£
177.70€ • 185.21$ • 147.93£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792327851
ISBN-10: 0792327853
Pagini: 390
Ilustrații: XIV, 390 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.74 kg
Ediția:1994
Editura: Springer Us
Colecția Springer
Seria Nonconvex Optimization and Its Applications
Locul publicării:New York, NY, United States
ISBN-10: 0792327853
Pagini: 390
Ilustrații: XIV, 390 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.74 kg
Ediția:1994
Editura: Springer Us
Colecția Springer
Seria Nonconvex Optimization and Its Applications
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Preface. Scheduling Multiprocessor Flow Shops; Bo Chen. The k-Walk Polyhedron; C.R. Coullard, A.B. Gamble, Jin Liu. Two Geometric Optimization Problems; B. Dasgupta, V. Roychowdhury. A Scaled Gradient Projection Algorithm for Linear Complementarity Problems; Jiu Ding. A Simple Proof for a Result of Ollerenshaw on Steiner Trees; Xiufeng Du, Ding-Zhu Du, Biao Gao, Lixue Qü. Optimization Algorithms for the Satisfiability (SAT) Problem; Jun Gu. Ergodic Convergence in Proximal Point Algorithms with Bregman Functions; O. Güler. Adding and Deleting Constraints in the Logarithmic Barrier Method for LP; D. den Hertog, C. Roos, T. Terlaky. A Projection Method for Solving Infinite Systems of Linear Inequalities; Hui Hu. Optimization Problems in Molecular Biology; Tao Jiang, Ming Li. A Dual Affine Scaling Based Algorithm for Solving Linear Semi-Infinite Programming Problems; Chih-Jen Lin, Shu-Cherng Fang, Soon-Yi Wu. A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming; Zhi-Quan Luo, Yinyu Ye. A Modified Barrier Function Method for Linear Programming; M.R. Osborne. A New Facet Class and a Polyhedral Method for the Three-Index Assignment Problem; Liqun Qi, E. Balas, G. Gwan. A Finite Simplex-Active-Set Method for Monotropic Piecewise Quadratic Programming; R.T. Rockafellar, Jie Sun. A New Approach in the Optimization of Exponential Queues; S.H. Xu. The Euclidean Facilities Location Problem; Guoliang Xue, Changyu Wang. Optimal Design of Large-Scale Opencut Coal Mine System; Dezhuang Yang. On the Strictly Complementary Slackness Relation in Linear Programming; Shuzhong Zhang. Analytical Properties of the Central Trajectory in Interior Point Methods; Gongyun Zhao,Jishan Zhu. TheApproximation of Fixed Points of Robust Mappings; Quan Zheng, Deming Zhuang.