✦ LIBER ✦

A note on finding optimum branchings

✍ Scribed by P. M. Camerini; L. Fratta; F. Maffioli

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 205 KB
Volume: 9
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230090403

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding optimum branchings

✍ R. E. Tarjan 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB

A note on finding roots of monotonic bra

A note on finding roots of monotonic branching functions

✍ Lawther, Ray 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

A simple derivation of edmonds' algorith

A simple derivation of edmonds' algorithm for optimum branchings

✍ R. M. Karp 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

Historical note on optimum spanning arbo

Historical note on optimum spanning arborescences

✍ J. D. Murchland 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

A note on the optimum choice for penalty

A note on the optimum choice for penalty parameters

✍ Nour-Omid, Bahram ;Wriggers, Peter 📂 Article 📅 1987 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 290 KB

This paper looks at the numerical characteristics of penalty methods for evaluating the solution of symmetric systems of equations with imposed constraints. The sources of error resulting from this approach are identified and an estimate for the penalty parameter that minimizes this error is obtaine