𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation conditions for max-min problems with connected sets

✍ Scribed by E.R. Avakov

Publisher
Elsevier Science
Year
1978
Weight
798 KB
Volume
18
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation results for min-max path c
Approximation results for min-max path cover problems in vehicle routing
✍ Zhou Xu; Liang Xu; Chung-Lun Li πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 410 KB

## Abstract This article studies a min‐max path cover problem, which is to determine a set of paths for __k__ capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when

Approximate source conditions in Tikhono
Approximate source conditions in Tikhonov–Phillips regularization and consequences for inverse problems with multiplication operators
✍ Bernd Hofmann πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 171 KB

## Abstract The object of this paper is threefold. First, we investigate in a Hilbert space setting the utility of approximate source conditions in the method of Tikhonov–Phillips regularization for linear ill‐posed operator equations. We introduce distance functions measuring the violation of cano