𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strongly polynomial algorithm for solving the general problem of least modules

✍ Scribed by V. V. Mironov

Book ID
111473917
Publisher
Pleiades Publishing
Year
2010
Tongue
English
Weight
706 KB
Volume
3
Category
Article
ISSN
1995-4239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A strongly polynomial algorithm for the
A strongly polynomial algorithm for the inverse shortest arborescence problem
✍ Hu Zhiquan; Liu Zhenhong πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 909 KB

In this paper an inverse problem of the weighted shortest arborescence problem is discussed. That is. given a directed graph G and a set of nonnegative costs on its arcs. we need to modify those costs as little as possible to ensure that T, a given (.I-arborescence of G, is the shortest one. It is

A strongly polynomial algorithm for the
A strongly polynomial algorithm for the uniform balanced network flow problem
✍ Maria Grazia ScutellΓ‘ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 565 KB

## Several balanced optimization problems have been analysed in the literature. Here, the balanced network flow problem in the uniform case is studied, and it is shown that it can be solved by the Newton's approach in O(n' log3 n) max-flow computations. The key of the proof is an extension of Rad