.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Advances in Optimization and Approximation
. Ed(S): Du, Ding-Zhu; Sun, Jie
€ 202.06
FREE Delivery in Ireland
Description for Advances in Optimization and Approximation
Hardback. Offers a collection of research papers in optimization and approximation that covers the research on optimization problems, including scheduling, location, assignment, linear and nonlinear programming problems as well as problems in molecular biology. This book focuses on algorithmic aspects of research work in optimization. Editor(s): Du, Ding-Zhu; Sun, Jie. Series: Nonconvex Optimization and Its Applications. Num Pages: 404 pages, biography. BIC Classification: PBC; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 23. Weight in Grams: 1650.
2. The Algorithm ...59 3. Convergence Analysis ..., ...60 4. Complexity Analysis ...63 5. Conclusions ...67 References ...67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees ...68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction ...68 2. In the Euclidean Plane ...69 3. In the Rectilinear Plane ...70 4. Discussion ...-...71 References ...71 Optimization Algorithms for the Satisfiability (SAT) Problem ...72 Jun Gu 1. Introduction ...72 2. A Classification of SAT Algorithms ...7:3 3. Preliminaries ...IV 4. Complete Algorithms and Incomplete Algorithms ...81 5. Optimization: An Iterative Refinement Process ...86 6. Local Search Algorithms ... Read more
2. The Algorithm ...59 3. Convergence Analysis ..., ...60 4. Complexity Analysis ...63 5. Conclusions ...67 References ...67 A Simple Proof for a Result of Ollerenshaw on Steiner Trees ...68 Xiufeng Du, Ding-Zhu Du, Biao Gao, and Lixue Qii 1. Introduction ...68 2. In the Euclidean Plane ...69 3. In the Rectilinear Plane ...70 4. Discussion ...-...71 References ...71 Optimization Algorithms for the Satisfiability (SAT) Problem ...72 Jun Gu 1. Introduction ...72 2. A Classification of SAT Algorithms ...7:3 3. Preliminaries ...IV 4. Complete Algorithms and Incomplete Algorithms ...81 5. Optimization: An Iterative Refinement Process ...86 6. Local Search Algorithms ... Read more
Product Details
Format
Hardback
Publication date
1994
Publisher
Kluwer Academic Publishers United States
Number of pages
404
Condition
New
Series
Nonconvex Optimization and Its Applications
Number of Pages
390
Place of Publication
Dordrecht, Netherlands
ISBN
9780792327851
SKU
V9780792327851
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Advances in Optimization and Approximation