✦ LIBER ✦

A network flow approach to the Minimum Common Integer Partition Problem

✍ Scribed by Wenbo Zhao; Peng Zhang; Tao Jiang

Book ID: 108281245
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 179 KB
Volume: 369
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An integer concave minimization approach

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

✍ R. Horst; N. V. Thoai 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 624 KB

A stochastic integer programming approac

A stochastic integer programming approach to solving a synchronous optical network ring design problem

✍ J. Cole Smith; Andrew J. Schaefer; Joyce W. Yen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

A semiclassical approach to the integer

A semiclassical approach to the integer quantum Hall problem

✍ M.A Hidalgo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 101 KB

An Integer-Programming Approach to the B

An Integer-Programming Approach to the Bicriteria Multicasting Problem in Optical Networks

✍ Dawande, M.; Gupta, R. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 976 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 Lagrangean heuristic for the capacitat

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

✍ Torbjörn Larsson; Athanasios Migdalas; Mikael Rönnqvist 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB