𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A robust and efficient algorithm for planar competitive location problems

✍ Scribed by J. L. Redondo; J. Fernández; I. García; P. M. Ortigosa

Publisher
Springer US
Year
2007
Tongue
English
Weight
454 KB
Volume
167
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and cut algorithm for hub locat
A branch and cut algorithm for hub location problems with single assignment
✍ Martine Labbé; Hande Yaman; Eric Gourdin 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can tra

A Robust Test for Multi-Sample Location
A Robust Test for Multi-Sample Location Problems with Unequal Group Variances and Nonnormality
✍ Dr. M. A. Tabatabai; US W. Y. Tan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB 👁 2 views

## Sunmn y A robust test (to be referred to as Y\* test) is proposed for W i n g equality of several group means without assuming normality> and equality of variances. This test statistic ie obtained by combining Tiku's MML robust procedure with the James statistic. Monte Carlo simulation studies

A New Multichannel Recursive Least Squar
A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering
✍ Y. Boutalis; C. Papaodysseus; E. Koukoutsis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 183 KB

In this paper, a new multichannel recursive least squares (MRLS) adaptive algorithm is presented which has a number of very interesting properties. The proposed computational scheme performs adaptive filtering via the use of a finite window, where the burdening past information is dropped directly b