𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simplex algorithm for minimum-cost network-flow problems in infinite networks

✍ Scribed by Thomas C. Sharkey; H.Edwin Romeijn

Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
217 KB
Volume
52
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 expanded maximum neural network algor
An expanded maximum neural network algorithm for a channel assignment problem in cellular radio networks
✍ Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 2 views

In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be