𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Iterative Scheme for the N-Competing Species Problem

✍ Scribed by A. Tineo

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
407 KB
Volume
116
Category
Article
ISSN
0022-0396

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved approximation scheme for the
An improved approximation scheme for the Group Steiner Problem
✍ C. S. Helvig; Gabriel Robins; Alexander Zelikovsky πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 322 KB πŸ‘ 1 views

the Group Steiner Problem asks for a minimumcost tree which contains at least one node from each group N i N i N i . In this paper, we give polynomial-time O O O(k k k )approximation algorithms for any fixed > > > 0. This result improves the previously known O O O(k k k)-approximation. We also apply

An implicit enumeration scheme for the b
An implicit enumeration scheme for the batch selection problem
✍ A. Agnetis; F. Rossi; S. Smriglio πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

## Abstract An important problem arising in the management of logistic networks is the following: given a set of activities to be performed, each requiring a set of resources, select the optimal set of resources compatible with the system capacity constraints. This problem is called Batch Selection

An iterative method for the shape recons
An iterative method for the shape reconstruction of the inverse Euler problem
✍ Wenjing Yan; Yaling He; Yichen Ma πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 112 KB

## Abstract This article is concerned with the shape reconstruction for the inviscid fluid governed by the Euler equations. By formulating the domain derivative of the Euler equations and applying a regularized Gauss‐Newton iterative algorithm, the numerical examples are given for recovering the sh

An approximation scheme for some Steiner
An approximation scheme for some Steiner tree problems in the plane
✍ Wang, Lusheng; Jiang, Tao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 536 KB

We design a polynomial-time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local, i.e., in the minimum-cost spanning tree for the given set of regular points, the length of the longest edge is at most c times the length of the shortest edge.

An iterative penalty method for the leas
An iterative penalty method for the least squares solution of boundary value problems
✍ D. G. Zeitoun; J. P. Laible; G. F. Pinder πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 426 KB πŸ‘ 2 views

This article is concerned with iterative techniques for linear systems of equations arising from a least squares formulation of boundary value problems. In its classical form, the solution of the least squares method is obtained by solving the traditional normal equation. However, for nonsmooth boun