Advances in Optimization and Approximation
Editat de Ding-Zhu Du, Jie Sunen Limba Engleză Paperback – 12 oct 2011
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 919.16 lei 43-57 zile | |
| Springer Us – 12 oct 2011 | 919.16 lei 43-57 zile | |
| Hardback (1) | 922.34 lei 43-57 zile | |
| Springer Us – 31 mai 1994 | 922.34 lei 43-57 zile |
Preț: 919.16 lei
Preț vechi: 1120.92 lei
-18%
Puncte Express: 1379
Preț estimativ în valută:
162.44€ • 187.48$ • 141.67£
162.44€ • 187.48$ • 141.67£
Carte tipărită la comandă
Livrare economică 18 mai-01 iunie
Specificații
ISBN-13: 9781461336310
ISBN-10: 1461336317
Pagini: 390
Ilustrații: XIV, 390 p.
Dimensiuni: 160 x 240 x 23 mm
Greutate: 0.65 kg
Ediția:Softcover Reprint of the Original 1st 1994 edition
Editura: Springer Us
Locul publicării:New York, NY, United States
ISBN-10: 1461336317
Pagini: 390
Ilustrații: XIV, 390 p.
Dimensiuni: 160 x 240 x 23 mm
Greutate: 0.65 kg
Ediția:Softcover Reprint of the Original 1st 1994 edition
Editura: Springer Us
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.