✦ LIBER ✦

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

✍ Scribed by Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 279 KB
Volume: 34
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-005-1658-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A branch-and-bound algorithm for the sol

A branch-and-bound algorithm for the solution of two network scheduling problems

✍ A. I. Kuksa; B. E. Polyachenko 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 397 KB

A branch-and-bound algorithm for solving

A branch-and-bound algorithm for solving fixed charge problems

✍ Patrick G. McKeown 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

A branch-and-bound algorithm for hard mu

A branch-and-bound algorithm for hard multiple knapsack problems

✍ Alex S. Fukunaga 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 683 KB

A deterministic annealing algorithm for

A deterministic annealing algorithm for the minimum concave cost network flow problem

✍ Chuangyin Dang; Yabin Sun; Yuping Wang; Yang Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 292 KB

The existing algorithms for the minimum concave cost network flow problems mainly focus on the singlesource problems. To handle both the single-source and the multiple-source problem in the same way, especially the problems with dense arcs, a deterministic annealing algorithm is proposed in this pap

A composite branch and bound, cutting pl

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

✍ Kurt M. Bretthauer; A.Victor Cabot 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 906 KB