✦ LIBER ✦

Complexity and algorithms for convex network optimization and other nonlinear problems

✍ Scribed by Dorit S. Hochbaum

Publisher: Springer
Year: 2005
Tongue: English
Weight: 245 KB
Volume: 3
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-005-0078-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity and algorithms for nonlinear

Complexity and algorithms for nonlinear optimization

✍ Dorit S. Hochbaum 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 627 KB

A distributed algorithm for convex netwo

A distributed algorithm for convex network optimization problems

✍ Stavros A Zenios; John M Mulvey 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 873 KB

Minimum-cost strong network orientation

Minimum-cost strong network orientation problems: Classification, complexity, and algorithms

✍ Burkard, Rainer E.; Feldbacher, Karin; Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

In the minimum-cost strong network orientation problem (MCSO), we are given an undirected graph G Å (V, E) with nonnegative edge lengths ᐉ(e) and a transportation schedule T Å {(s 1 , t 1 , w 1 ), . . . , (s k , t k , w k )}, where w i units of weight have to be transported from the source vertex s

Synchronous and asynchronous implementat

Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization

✍ Emmanuel D. Chajakis; Stavros A. Zenios 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 977 KB

A parametric algorithm for convex cost n

A parametric algorithm for convex cost network flow and related problems

✍ R.K. Ahuja; J.L. Batra; S.K. Gupta 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Complexity and Algorithms for Graph and

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 231 KB