✦ LIBER ✦

Optimization methods for large-scale multiechelon stockage problems

✍ Scribed by Larry J. Leblanc

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 654 KB
Volume: 34
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(198704)34:2<239::aid-nav3220340209>3.0.co;2-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partially reduced sqp methods for large-

Partially reduced sqp methods for large-scale nonlinear optimization problems

✍ Volker Schulz; Hans Georg Book 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 939 KB

Large-scale convex optimization methods

Large-scale convex optimization methods for air quality policy assessment

✍ D.A. Carlson; A. Haurie; J.-P. Vial; D.S. Zachary 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A three-level optimization method for fu

A three-level optimization method for fuzzy large-scale multiobjective nonlinear programming problems

✍ Hitoshi Yano; Masatoshi Sakawa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Real-space multigrid methods for large-s

Real-space multigrid methods for large-scale electronic structure problems

✍ J. Bernholc; E. L. Briggs; D. J. Sullivan; C. J. Brabec; M. Buongiorno Nardelli; 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 1 views

We describe the development and applications of a new electronic structure method that uses a real-space grid as a basis. Multigrid techniques provide preconditioning and convergence acceleration at all length scales and therefore lead to Ž . particularly efficient algorithms. The salient points of

Multiple-scale reproducing kernel partic

Multiple-scale reproducing kernel particle methods for large deformation problems

✍ Wing Kam Liu; Sukky Jun 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 524 KB

Reproducing Kernel Particle Method (RKPM) with a built-in feature of multiresolution analysis is reviewed and applied to large deformation problems. Since the application of multiresolution RKPM to the large deformation problems is still in its early stage of development, we introduce, in this paper

Deflated block Krylov subspace methods f

Deflated block Krylov subspace methods for large scale eigenvalue problems

✍ Qiang Niu; Linzhang Lu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 530 KB

We discuss a class of deflated block Krylov subspace methods for solving large scale matrix eigenvalue problems. The efficiency of an Arnoldi-type method is examined in computing partial or closely clustered eigenvalues of large matrices. As an improvement, we also propose a refined variant of the A