𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A limit-method for solving period problems on minimal surfaces

✍ Scribed by Kelly Lübeck; Valério Ramos Batista

Publisher
Springer-Verlag
Year
2008
Tongue
French
Weight
458 KB
Volume
263
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A shortest augmenting path method for so
A shortest augmenting path method for solving minimal perfect matching problems
✍ Ulrich Derigs 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a

On a numerical method for solving obstac
On a numerical method for solving obstacle problems
✍ Muhammad Aslam Noor; Rafi Ahmad Ashrafi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Variational inequality theory provides us with a general and unified framework to study a large class of unrelated free and moving boundary problems that arise in pure and applied sciences. In this paper we show that a class of variational inequalities related with obstacle problems can be character

Variations on a cutting plane method for
Variations on a cutting plane method for solving concave minimization problems with linear constraints
✍ A. Victor Cabot 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th