✦ LIBER ✦

Fast algorithms for load-flow problems

✍ Scribed by Y. Wallach; V. Conrad

Publisher: Springer
Year: 1977
Tongue: English
Weight: 643 KB
Volume: 59
Category: Article
ISSN: 1432-0487
DOI: 10.1007/bf01412478

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithms for long transportation

Fast algorithms for long transportation problems

✍ A. Brandt; J. Intrator 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

Study of fast decoupled load flow algori

Study of fast decoupled load flow algorithms with substantially reduced memory requirements

✍ A. Keyhani 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 586 KB

On fast load partitioning by simulated a

On fast load partitioning by simulated annealing and heuristic algorithms for general class of problems

✍ G.S. Singh; Ketan R. Deshpande 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 657 KB

A fast algorithm for the minimax flow pr

A fast algorithm for the minimax flow problem with 01 weights

✍ C.-C. Han 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Fast coupled transient load flow

✍ S. Jovanovic; B. Fox; B.W. Hogg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Combinatorial Approximation Algorithms f

Combinatorial Approximation Algorithms for Generalized Flow Problems

✍ Jeffrey D Oldham 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier µ v w for each arc v w . For every unit of flow entering the arc, µ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi