✦ LIBER ✦

A mofified gub algorithm for solving linear minimax problems

✍ Scribed by Takahito Kuno; Kouji Mori; Hiroshi Konno

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 426 KB
Volume: 36
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(198906)36:3<311::aid-nav3220360308>3.0.co;2-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for solving a spatial optimis

Algorithms for solving a spatial optimisation problem on a parallel computer

✍ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

ON THE CONVERGENCE OF ZERO-FINDING EIGEN

ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS

✍ MOHAMMEDI R. ABDEL-AZIZ 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ÿnding technique for solving the non-linear eigenvalue problems. The main

A branch-and-cut algorithm for solving g

A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs

✍ Suhl, Uwe H.; Hilbert, Heinrich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p

An implicit numerical algorithm for solv

An implicit numerical algorithm for solving non-hydrostatic free-surface flow problems

✍ M. M. Namin; B. Lin; R. A. Falconer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB 👁 1 views

On a robust multilevel method applied fo

On a robust multilevel method applied for solving large-scale linear elasticity problems

✍ Padiy, Alexander 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB 👁 1 views

The paper discusses an iterative scheme for solving large-scale three-dimensional linear elasticity problems, discretized on a tensor product of two-dimensional and one-dimensional meshes. A framework is chosen of the additive AMLI method to develop a preconditioner of a `black-box' type which is ro

A branch-and-cut algorithm for solving a

A branch-and-cut algorithm for solving an intraring synchronous optical network design problem

✍ Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong-in 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 2 views

In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assig