✦ LIBER ✦

A polynomial time solvable concave network flow problem

✍ Scribed by G. M. Guisewite; P. M. Pardalos

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 370 KB
Volume: 23
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230230208

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strongly polynomial time algorithms for

Strongly polynomial time algorithms for certain concave minimization problems on networks

✍ Hoang Tuy; Nguyen Dinh Dan; Saied Ghannadan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A class of linear complementarity proble

A class of linear complementarity problems solvable in polynomial time

✍ Yinyu Ye; Panos M. Pardalos 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Heuristic solutions for general concave

Heuristic solutions for general concave minimum cost network flow problems

✍ Dalila B.M.M. Fontes; José Fernando Gonçalves 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N

A minimum concave-cost dynamic network f

A minimum concave-cost dynamic network flow problem with an application to lot-sizing

✍ Stephen C. Graves; James B. Orlin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 602 KB

Upper bounds for single-source uncapacit

Upper bounds for single-source uncapacitated concave minimum-cost network flow problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

On strongly polynomial variants of the n

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 324 KB