✦ LIBER ✦

Network flow problems and permutationally concave games

✍ Scribed by Christian Trudeau

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 640 KB
Volume: 58
Category: Article
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2009.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch-and-Bound Algorithm for Concave

A Branch-and-Bound Algorithm for Concave Network Flow Problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 279 KB

A polynomial time solvable concave netwo

A polynomial time solvable concave network flow problem

✍ G. M. Guisewite; P. M. Pardalos 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 370 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

An algorithm for a concave production co

An algorithm for a concave production cost network flow problem

✍ Yasutoshi Yajima; Hiroshi Konno 📂 Article 📅 1999 🏛 Japan Society for Industrial and Applied Mathemati 🌐 English ⚖ 1005 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

Lower Bounds from State Space Relaxation

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 216 KB